Electronic Resource
Springer
BIT
23 (1983), S. 267-270
ISSN:
1572-9125
Keywords:
Linear Programming
;
Enumeration
;
Degeneracy
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In the case of degeneracy in an LP-formulation, there is not a one-to-one correspondence between extreme points and feasible bases. If the task is to find thek best extreme points in the set of feasible solutions to an LP, this lack of correspondence has a certain importance, since methods based on the Simplex Algorithm are oriented towards feasible bases instead of the relevant extreme points. We therefore present an easily implementable method to avoid this problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02218448
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
