Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm

DOI10.1287/MOOR.21.4.839zbMATH Open0867.90076OpenAlexW2014088975MaRDI QIDQ4332254FDOQ4332254

Authors: Robert M. Freund 

Publication date: 13 February 1997

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.21.4.839

Recommendations

• New trajectory-following polynomial-time algorithm for linear programming problems
• A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• scientific article; zbMATH DE number 1300325
• A new polynomial-time algorithm for linear programming

zbMATH Keywords

\(\beta\)-balanced solutionfollowing a trajectoryinfeasible starting point

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (3)

• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
• Infeasible/feasible search trajectories and directional rounding in integer programming
• A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start

This page was built for publication: Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332254)