David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Although it is NP-complete to decide whether a linear programming problem is degenerate, the ε-perturbation method can be used to reduce in polynomial time any linear programming problem with rational coefficients to a nondegenerate problem. The perturbed problem has the same status as the given one in terms of feasibility and unboundedness, and optimal bases of the perturbed problem are optimal in the given problem. © 1989.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
J. LaRue, C. Ting
Proceedings of SPIE 1989
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics