Abstract
We consider the continuous trajectories of the vector field induced by the primal affine scaling algorithm as applied to linear programming problems in standard form. By characterizing these trajectories as solutions of certain parametrized logarithmic barrier families of problems, we show that these trajectories tend to an optimal solution which in general depends on the starting point. By considering the trajectories that arise from the Lagrangian multipliers of the above mentioned logarithmic barrier families of problems, we show that the trajectories of the dual estimates associated with the affine scaling trajectories converge to the so called ‘centered’ optimal solution of the dual problem. We also present results related to asymptotic direction of the affine scaling trajectories. We briefly discuss how to apply our results to linear programs formulated in formats different from the standard form. Finally, we extend the results to the primal-dual affine scaling algorithm.
Similar content being viewed by others
References
I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, “An implementation of Karmarkar's algorithm for linear programming,”Mathematical Programming 44 (1989) 297–335.
E.R. Barnes, “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.
D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming,”Transactions of the American Mathematical Society 314 (1989) 499–581.
I.I. Dikin, “Iterative solution of problems of linear and quadratic programming,”Soviet Mathematics Doklady 8 (1967) 674–675.
A. Fiacco and G. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley and Sons, New York, 1955).
N. Karmarkar, “A new polynomial time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.
N. Karmarkar, Talk at the University of California at Berkeley (Berkeley, CA, 1984).
N. Megiddo, “Pathways to the optimal set in linear programming,” in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior-Point Algorithms and Related Methods (Springer, Berlin, 1989) pp. 131–158.
N. Megiddo and M. Shub, “Boundary behavior of interior point algorithms for linear programming,”Mathematics of Operations Research 14 (1989) 97–146.
C.L. Monma and A.J. Morton, “Computational experience with a dual affine variant of Karmarkar's method for linear programming,”Operations Research Letters 6 (1987) 261–267.
R.D.C. Monteiro, I. Adler and M.G.C. Resende, “A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,”Mathematics of Operations Research 15 (1990) 191–214.
A. Schrijver,Theory of Linear and Integer Programming (John Wiley & Sons, New York 1986).
R.J. Vanderbei, M.S. Meketon and B.A. Freedman, “A modification of Karmarkar's linear programming algorithm,”Algorithmica 1 (1986) 395–407.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Adler, I., Monteiro, R.D.C. Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Mathematical Programming 50, 29–51 (1991). https://doi.org/10.1007/BF01594923
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01594923