Abstract
We present a new definition of optimality intervals for the parametric right-hand side linear programming (parametric RHS LP) Problem ϑ(λ) = min{c t x¦Ax =b + λ¯b,x ≥ 0}. We then show that an optimality interval consists either of a breakpoint or the open interval between two consecutive breakpoints of the continuous piecewise linear convex function ϑ(λ). As a consequence, the optimality intervals form a partition of the closed interval {λ; ¦ϑ(λ)¦ < ∞}. Based on these optimality intervals, we also introduce an algorithm for solving the parametric RHS LP problem which requires an LP solver as a subroutine. If a polynomial-time LP solver is used to implement this subroutine, we obtain a substantial improvement on the complexity of those parametric RHS LP instances which exhibit degeneracy. When the number of breakpoints of ϑ(λ) is polynomial in terms of the size of the parametric problem, we show that the latter can be solved in polynomial time.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
G. B. Dantzig,Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
I. I. Dikin, Iterative solution of problems of linear and quadratic programming,Soviet Mathematics Doklady 8 (1967), 674–675.
R. M. Freund, R. Roundy, and M. J. Todd, Identifying the set of always active constraints in a system of linear inequalities by a single linear program, Technical Report, Sloan W. P. No. 1674-85, Boston, MA, 1985.
T. Gal,Postoptimal Analysis, Parametric Programming and Related Topics, McGraw-Hill, New York, 1979.
S. I. Gass and T. L. Saaty, The computational algorithm for the parametric objective function,Naval Research Logistics Quarterly,2 (1955), 39–45.
N. Karmarkar, A new polynomial time algorithm for linear programming,Combinatorica 4 (1984), 373–395.
L. G. Khachiyan, A polynomial algorithm in linear programming,Soviet Mathematics Doklady 20 (1979), 191–194.
K. G. Murty, Computational complexity of parametric linear programming,Mathematical Programming 19 (1980), 213–219.
K. G. Murty,Linear Programming, Wiley, 1983.
A. Schrijver,Theory of Linear and Integer Programming, Wiley, 1986.
Author information
Authors and Affiliations
Additional information
Communicated by Nimrod Megiddo.
This research was partially funded by the United States Navy-Office of Naval Research under Contract N00014-87-K-0202. Its financial support is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Adler, I., Monteiro, R.D.C. A geometric view of parametric linear programming. Algorithmica 8, 161–176 (1992). https://doi.org/10.1007/BF01758841
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01758841