Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
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.
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
A. Skumanich
SPIE OE/LASE 1992
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996