The use of the optimal partition in a linear programming solution for postoptimal analysis

[1]  A. J. Goldman,et al.  4. Theory of Linear Programming , 1957 .

[2]  A. Tucker.  1 . Dual Systems of Homogeneous Linear Relations , 1957 .

[3]  R. A. Good.  Systems of Linear Relations , 1959 .

[4]  J. G. Evans,et al.  Postoptimal Analyses, Parametric Programming, and Related Topics , 1979 .

[5]  Joyce van Loon.  Irreducibly inconsistent systems of linear inequalities , 1981 .

[6]  Stanley Zionts,et al.  Redundancy in Mathematical Programming , 1983 .

[7]  Michael J. Todd,et al.  Identifying the set of always-active constraints in a system of linear inequalities by a single linear program , 1985 .

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

[9]  T. Gal.  Shadow prices and sensitivity analysis in linear programming under degeneracy , 1986 .

[10]  James E. Ward,et al.  Approaches to sensitivity analysis in linear programming , 1991 .

[11]  John W. Chinneck,et al.  Locating Minimal Infeasible Constraint Sets in Linear Programs , 1991, INFORMS J. Comput..

[12]  Peter J. Stuckey.  Incremental Linear Constraint Solving and Detection of Implicit Equalities , 1991, INFORMS J. Comput..

[13]  Donna L. Retzlaff-Roberts,et al.  The Trade-off Between Hospital Cost and Quality of Care: An Exploratory Empirical Analysis , 1992, Medical care.

[14]  J. Chinneck.  Viability analysis: A formulation aid for all classes of network models , 1992 .

[15]  Shuzhong Zhang,et al.  Pivot rules for linear programming: A survey on recent theoretical developments , 1993, Ann. Oper. Res..

[16]  John W. Chinneck,et al.  MINOS(IIS): Infeasibility analysis using MINOS , 1994, Comput. Oper. Res..