Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
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.
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008