Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysisand Computational Aspects

摘要

The interior point methodology is used to cover the main issues in linear programming: duality theory, parametric and sensitivity analysis, and algorithmic and computational aspects. The aim is to provide a global view on the subject matter. Various major facets of the theory are gathered. Only one specific algorithm is presented with its convergence analysis.