On combined phase 1-phase 2 projective methods for linear programming

DOI10.1007/BF01185339zbMath0767.90048MaRDI QIDQ1207329

Yufei Wang, Michael J. Todd

Publication date: 1 April 1993

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

interior-point methodsprojective algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Combining phase I and phase II in a potential reduction algorithm for linear programming ⋮ An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution ⋮ A primal-dual interior-point method based on various selections of displacement step for symmetric optimization

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A polynomial Newton method for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• Conical projection algorithms for linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
• On Anstreicher's combined phase I-phase II projective algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Linear updates for a single-phase projective method
• Search directions for interior linear-programming methods
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• A Family of Search Directions for Karmarkar's Algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: On combined phase 1-phase 2 projective methods for linear programming