Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm

This paper gives a theory and method that specifies how the optimal solution of a linear program changes when the right-hand side of the original problem is changed and when the original optimal solution exhibits primal degeneracy. The method determines an optimal change vector as the resource availabilities change, and it calculates a range for which this vector is valid. Resource availabilities are allowed to change simultaneously in any arbitrary proportion, and the concept of an ''efficient resource bundle'' is introduced. The geometry of the optimal change vector is presented from which the desired results are derived. The connection between the geometrical results and their algebraic calculation in tableau-form is shown. Our method uses a pivoting algorithm and the relationship with post-optimality results from interior-point methods will be established.

[1]  Michael J. Best.  A compact formulation of an elastoplastic analysis problem , 1982 .

[2]  John M. Wilson,et al.  Advances in Sensitivity Analysis and Parametric Programming , 1998, J. Oper. Res. Soc..

[3]  H.-J. Kruse.  Degeneracy graphs and the neighbourhood problem , 1986 .

[4]  Gerard Sierksma,et al.  Balinski—Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces , 1998, Math. Program..

[5]  Renato D. C. Monteiro,et al.  A geometric view of parametric linear programming , 1992, Algorithmica.

[6]  H. J. Greenberg.  An analysis of degeneracy , 1986 .

[7]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[8]  Thomas M. Liebling,et al.  On the average length of lexicographic paths , 1986, Math. Program..

[9]  Peter Zörnig,et al.  Survey of solved and open problems in the degeneracy phenomenon , 1988, Math. Program..

[10]  Tomas Gal,et al.  Degeneracy graphs: theory and application an updated survey , 1993, Ann. Oper. Res..

[11]  Harvey J. Greenberg,et al.  Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program , 1999, SIAM J. Optim..

[12]  B. Jansen,et al.  Sensitivity analysis in linear programming: just be careful! , 1997 .

[13]  D. Aucamp,et al.  The Computation of Shadow Prices in Linear Programming , 1982 .

[14]  Andrew B. Whinston,et al.  Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market , 2003, Inf. Syst. Res..

[15]  M. Akgül.  A Note on Shadow Prices in Linear Programming , 1984 .

[16]  T. Gal.  Weakly redundant constraints and their impact on postoptimal analyses in LP , 1992 .

[17]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[18]  Richard D. McBride,et al.  The factorization approach to large-scale linear programming , 1976, Math. Program..

[19]  A. W. Tucker,et al.  Duality Theory of Linear Programs: A Constructive Approach with Applications , 1969 .

[20]  Andrew B. Whinston,et al.  A Market-Based Optimization Algorithm for Distributed Systems , 2007, Manag. Sci..

[21]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[22]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[23]  Michael J. Todd,et al.  Sensitivity analysis in linear programming and semidefinite programming using interior-point methods , 2001, Math. Program..

[24]  G. Knolmayer.  THE EFFECTS OF DEGENERACY ON COST-COEFFICIENT RANGES AND AN ALGORITHM TO RESOLVE INTERPRETATION PROBLEMS , 1984 .