Effective Computation of the Analytic Center of the Solution Set in Linear Programming Using Primal-Dual Interior-Point Methods
González-Lima, María D.
The centrality property satisfied by the analytic center of the solution set makes its computation very valuable for some linear programming applications. One such application coming from the economic and management sciences is Data Envelopment Analysis (DEA). In DEA one desires a solution of the underlying linear programming model that is in the relative interior of the solution set and one that is in some sense as far away as possible from the relative small changes in the data. In this work we study the effective computation of the analytic center solution by the use of primal-dual interior-point methods. We present an unified study of existing theoretical results for primal-dual interior-point algorithms as they concern the convergence of the iteration sequence and the convergence of the iteration sequence to the analytic center. These theoretical results are evaluated from the point of view of the practical computation of the analytic center. We propose a primal-dual interior-point algorithm for effectively computing the analytic center of the solution set. The algorithm proposed combines good theoretical and numerical properties and its ability to solve real world problems from the DEA application is demonstrated.
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16826
Citable link to this pagehttps://hdl.handle.net/1911/101853
MetadataShow full item record
- CAAM Technical Reports