On degeneracy in enumeration |
| |
Authors: | Stein W Wallace |
| |
Institution: | (1) Dept. of Science and Technology, The Chr. Michelson Inst., Fantoftvegen 38, N-5036 Fantoft, Norway |
| |
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. |
| |
Keywords: | Linear Programming Enumeration Degeneracy |
本文献已被 SpringerLink 等数据库收录! |
|