Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(online) ISSN 0002-9947(print)

 

The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories


Authors: D. A. Bayer and J. C. Lagarias
Journal: Trans. Amer. Math. Soc. 314 (1989), 499-526
MSC: Primary 90C05; Secondary 34A99, 52A40
MathSciNet review: 1005525
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: This series of papers studies a geometric structure underlying Karmarkar's projective scaling algorithm for solving linear programming problems. A basic feature of the projective scaling algorithm is a vector field depending on the objective function which is defined on the interior of the polytope of feasible solutions of the linear program. The geometric structure studied is the set of trajectories obtained by integrating this vector field, which we call $ P$-trajectories. We also study a related vector field, the affine scaling vector field, and its associated trajectories, called $ A$-trajectories. The affine scaling vector field is associated to another linear programming algorithm, the affine scaling algorithm. Affine and projective scaling vector fields are each defined for linear programs of a special form, called strict standard form and canonical form, respectively.

This paper derives basic properties of $ P$-trajectories and $ A$-trajectories. It reviews the projective and affine scaling algorithms, defines the projective and affine scaling vector fields, and gives differential equations for $ P$-trajectories and $ A$-trajectories. It shows that projective transformations map $ P$-trajectories into $ P$-trajectories. It presents Karmarkar's interpretation of $ A$-trajectories as steepest descent paths of the objective function $ \left\langle {{\mathbf{c}},{\mathbf{x}}} \right\rangle $ with respect to the Riemannian geometry $ d{s^2} = \sum\nolimits_{i = 1}^n {d{x_i}d{x_i}/x_i^2} $ restricted to the relative interior of the polytope of feasible solutions. $ P$-trajectories of a canonical form linear program are radial projections of $ A$-trajectories of an associated standard form linear program. As a consequence there is a polynomial time linear programming algorithm using the affine scaling vector field of this associated linear program: This algorithm is essentially Karmarkar's algorithm.

These trajectories are studied in subsequent papers by two nonlinear changes of variables called Legendre transform coordinates and projective Legendre transform coordinates, respectively. It will be shown that $ P$-trajectories have an algebraic and a geometric interpretation. They are algebraic curves, and they are geodesics (actually distinguished chords) of a geometry isometric to a Hubert geometry on a polytope combinatorially dual to the polytope of feasible solutions. The $ A$-trajectories of strict standard form linear programs have similar interpretations: They are algebraic curves, and are geodesics of a geometry isometric to Euclidean geometry.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 90C05, 34A99, 52A40

Retrieve articles in all journals with MSC: 90C05, 34A99, 52A40


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9947-1989-1005525-6
PII: S 0002-9947(1989)1005525-6
Article copyright: © Copyright 1989 American Mathematical Society