Abstract
We present a simplification and generalization of the recent homogeneous and self-dual linear programming (LP) algorithm. The algorithm does not use any Big-M initial point and achieves\(O(\sqrt {nL} )\)-iteration complexity, wheren andL are the number of variables and the length of data of the LP problem. It also detects LP infeasibility based on a provable criterion. Its preliminary implementation with a simple predictor and corrector technique results in an efficient computer code in practice. In contrast to other interior-point methods, our code solves NETLIB problems, feasible or infeasible, starting simply fromx=e (primal variables),y=0 (dual variables),z=e (dual slack variables), wheree is the vector of all ones. We describe our computational experience in solving these problems, and compare our results with OB1.60, a state-of-the-art implementation of interior-point algorithms.
Similar content being viewed by others
References
A. Altman and J. Gondzio, An efficient implementation of a higher order primal-dual interior point method for large sparse linear programming, Technical Report ZTSW-1/A214/92, Systems Research Institute, Polish Academy of Sciences, Poland (1992).
A.J. Goldman and A.W. Tucker, Polyhedral convex cones, in:Linear Inequalities and Related Systems, ed. H.W. Kuhn and A.W. Tucker (Princeton University Press, Princeton, NJ, 1956) p. 19.
M. Kojima, N. Megiddo and S. Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming, Mathematical Programming 61(1993)263.
I.J. Lustig, R.E. Marsten and D.F. Shanno, Starting and restarting the primal-dual interior point method, Rutcor Research Report RRR # 61-90, Rutgers, New Brunswick, NJ (1990).
I.J. Lustig, R.E. Marsten and D.F. Shanno, On implementing Mehrotra's predictor-corrector interior point method for linear programming, SIAM Journal on Optimization 2(1992)435.
I.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming, Mathematical Programming 66(1994)123.
S. Mehrotra, Higher order methods and their performance, Technical Report, TR90-16R1 (revision July 1991), Department of IE and MS, Northwestern University, Evanston, IL (1991).
S. Mehrotra, On the implementation of a (primal-dual) interior point method, SIAM Journal on Optimization 2(1992)575.
S. Mehrotra and Y. Ye, Finding an interior point in the optimal face of linear programs, Mathematical Programming 62(1993)497.
S. Mizuno, M.J. Todd and Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18(1993)964.
S. Mizuno, M.J. Todd and Y. Ye, A surface of analytic centers and infeasible-interior-point algorithms for linear programming, Mathematics of Operations Research 20(1995)135.
A.W. Tucker, Dual systems of homogeneous linear relations, in:Linear Inequalities and Related Systems, ed. H.W. Kuhn and A.W. Tucker (Princeton University Press, Princeton, NJ, 1956) p. 3.
F. Wu, S. Wu and Y. Ye, On quadratic convergence of the homogeneous and self-dual linear programming algorithm, Working Paper, College of Business Administration, The University of Iowa, Iowa City, IA (1993).
X. Xu, Interior point method for linear programming: Theory and practice, Ph.D. Dissertation, Institute of Systems Science, Academia Sinica. Beijing, China (1991).
Y. Ye, M.J. Todd and S. Mizuno, An171-1 homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research 19(1994)53.
Author information
Authors and Affiliations
Additional information
Research supported in part by NSF Grant DDM-9207347 and by an Iowa College of Business Administration Summer Grant.
Part of this work was done while the author was on a sabbatical leave from the University of Iowa and visiting the Cornell Theory Center, Cornell University, Ithaca, NY 14853, USA, supported in part by the Cornell Center for Applied Mathematics and by the Advanced Computing Research Institute, a unit of the Cornell Theory Center, which receives major funding from the National Science Foundation and IBM Corporation, with additional support from New York State and members of its Corporate Research Institute.
Rights and permissions
About this article
Cite this article
Xu, X., Hung, PF. & Ye, Y. A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann Oper Res 62, 151–171 (1996). https://doi.org/10.1007/BF02206815
Issue Date:
DOI: https://doi.org/10.1007/BF02206815