Yi Zhou, Parikshit Ram, et al.
ICLR 2023
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.
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Igor Devetak, Andreas Winter
ISIT 2003