Polynomiality of infeasible-interior-point algorithms for linear programming |
| |
Authors: | Shinji Mizuno |
| |
Affiliation: | (1) The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, 106 Tokyo, Japan |
| |
Abstract: | Kojima, Megiddo, and Mizuno investigate an infeasible-interior-point algorithm for solving a primal—dual pair of linear programming problems and they demonstrate its global convergence. Their algorithm finds approximate optimal solutions of the pair if both problems have interior points, and they detect infeasibility when the sequence of iterates diverges. Zhang proves polynomial-time convergence of an infeasible-interior-point algorithm under the assumption that both primal and dual problems have feasible points. In this paper, we show that a modification of the Kojima—Megiddo—Mizuno algorithm solves the pair of problems in polynomial time without assuming the existence of the LP solution. Furthermore, we develop anO(nL)-iteration complexity result for a variant of the algorithm.The original title was Polynomiality of the Kojima—Megiddo—Mizuno infeasible-interior-point algorithm for linear programming.Research performed while visiting Cornell University (April 1992 – January 1993) as an Overseas Research Scholar of the Ministry of Science, Education and Culture of Japan. |
| |
Keywords: | Polynomial-time Linear programming Primal-dual Interior-point algorithm |
本文献已被 SpringerLink 等数据库收录! |
|