Search directions for interior linear-programming methods
- 90 Downloads
Since Karmarkar published his algorithm for linear programming, several different interior directions have been proposed and much effort was spent on the problem transformations needed to apply these new techniques. This paper examines several search directions in a common framework that does not need any problem transformation. These directions prove to be combinations of two problem-dependent vectors, and can all be improved by a bidirectional search procedure.
We conclude that there are essentially two polynomial algorithms: Karmarkar's method and the algorithm that follows a central trajectory, and they differ only in a choice of parameters (respectively lower bound and penalty multiplier).
Key wordsKarmarkar's algorithm Linear programming Projective algorithm Conical projection Interior methods
Unable to display preview. Download preview PDF.
- I. Adler, M. Resende, and G. Veiga. An Implementation of Karmarkar's Algorithm for Linear Programming. Report ORC86-8, Operations Research Center, University of California, Berkeley, May 1986.Google Scholar
- E. R. Barnes and D. L. Jensen. A Polynomial-Time Version of the Affine-Scaling Algorithm. Manuscript in preparation, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1987.Google Scholar
- K. Bayer and J. C. Lagarias. Karmarkar's Linear Programming Algorithm and Newton's Method. Preprints, AT&T Bell Laboratories, Murray Hill, NJ, 1986.Google Scholar
- T. Cavalier and A. Soyster. Some Computational Experience and a Modification of the Karmarkar Algorithm. Working Paper 85–105, Department of Industrial and Management System Engineering, Pennsylvania State University, February 1985.Google Scholar
- A. Fiacco and G. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York, 1955.Google Scholar
- K. R. Frisch. The Logarithmic Potential Method of Convex Programming. Memorandum, University Institute of Economics, Oslo, May 1955.Google Scholar
- C. Gonzaga. A Conical Projection Algorithm for Linear Programming. Memorandum UCB/ERL M85/61, Electronics Research Laboratory, University of California, Berkeley, CA, July 1985.Google Scholar
- C. Gonzaga. An Algorithm for Solving Linear Programming Problems inO(n 3 L) operations. Memorandum UCB/ERL M87/10, Electronics Research Laboratory, University of California, Berkeley, CA, March 1987.Google Scholar
- C. Gonzaga. Conical Projection Algorithms for Linear Programming. Memorandum UCB/ERL M87/11, Electronics Research Laboratory, University of California, Berkeley, CA, March 1987. To appear inMathematical Programming.Google Scholar
- J. C. Lagarias. Personal communication.Google Scholar
- N. Megiddo. Pathways to the Optimal Set in Linear Programming. Research Report RJ 5295, IBM Almaden Research Center, San Jose, CA, 1986.Google Scholar
- M. Padberg. Solution of a Nonlinear Programming Problem Arising in the Projective Method for Linear Programming. Manuscript, New York University, New York, March 1985.Google Scholar
- P. M. Vaidya. An Algorithm for Linear Programming which RequiresO(((m+n)n 2+(m+n)1.5 n)L) Arithmetic Operations. Preprint, AT&T Bell Laboratories, Murray Hill, NJ, 1987.Google Scholar
- H. Yamashita. A Polynomially and Quadratically Convergent Method for Linear Programming. Manuscript, Mathematical Systems Institute Inc., Tokyo, October 1986.Google Scholar