Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming

In this paper we consider properties of the central path and the analytic center of the optimal face in the context of parametric linear programming. We first show that if the right-hand side vector of a standard linear program is perturbed, then the analytic center of the optimal face is one-side differentiable with respect to the perturbation parameter. In that case we also show that the whole analytic central path shifts in a uniform fashion. When the objective vector is perturbed, we show that the last part of the analytic central path is tangent to a central path defined on the optimal face of the original problem.

[1]  I. M. Pyshik,et al.  Table of integrals, series, and products , 1965 .

[2]  Harvey J. Greenberg,et al.  A computer-assisted analysis system for mathematical programming models and solutions : a user's guide for ANALYZE , 1993 .

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

[4]  J. Frédéric Bonnans,et al.  On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems , 1997, Math. Oper. Res..

[5]  G. Stewart On scaled projections and pseudoinverses , 1989 .

[6]  Shinji Mizuno,et al.  A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming , 1995, Math. Oper. Res..

[7]  T. Terlaky,et al.  The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming , 1996 .

[8]  Harvey J. Greenberg,et al.  On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance , 1998, SIAM J. Optim..

[9]  H. J. Greenberg Rim Sensitivity Analysis from an Interior Solution , 1996 .

[10]  Renato D. C. Monteiro,et al.  A general parametric analysis approach and its implication to sensitivity analysis in interior point methods , 1996, Math. Program..

[12]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[13]  Shuzhong Zhang On the Strictly Complementary Slackness Relation in Linear Programming , 1994 .

[14]  Harvey J. Greenberg,et al.  The use of the optimal partition in a linear programming solution for postoptimal analysis , 1994, Oper. Res. Lett..

[15]  G. Sonnevend,et al.  Applications of the notion of analytic center in approximation (estimation) problems , 1989 .

[16]  Robert M. Freund,et al.  Condition measures and properties of the central trajectory of a linear program , 1998, Math. Program..

[17]  Michael J. Todd,et al.  A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm , 1990, Oper. Res..

[18]  Osman Güler,et al.  Limiting behavior of weighted central paths in linear programming , 1994, Math. Program..

[19]  N. Megiddo Pathways to the optimal set in linear programming , 1989 .

[20]  C. Roos,et al.  Interior point approach to linear programming: theory, algorithms & parametric analysis , 1992 .