Techniques that strive to combat the influence of degeneracy in linear programming problems
AbstractDegeneracy can cause enormous problems when solving large scale linear programming problems. This is not only because there is a possibility that the problem can cycle, but also because a large number of iterations can be executed that do not improve the objective. In this article a procedure which utilises derived reduced costs is discussed. The derived reduced cost of a non- basic variable is defined in such a way that it makes the introduction to the non-basic variable into the basis unattractive if such a decision fails to improve the objective. The procedure deliberately strives to combat degeneracy using derived reduced costs, but it also utilises the advantageous properties of the classical gradient methods.
Download data is not yet available.
The following license applies:
Attribution CC BY
This license lets others distribute, remix, tweak, and build upon your work, even commercially, as long as they credit you for the original creation.