A ``build-down scheme for linear programming

DOI10.1007/BF01585727zbMath0698.90054OpenAlexW1997390772MaRDI QIDQ912758

Yinyu Ye

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585727

zbMATH Keywords

simplex methodKarmarkar algorithmbuild-down schemedual ellipsoid

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Eliminating columns in the simplex method for linear programming, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Adaptive constraint reduction for convex quadratic programming, On the finite convergence of interior-point algorithms for linear programming, A build-up variant of the logarithmic barrier method for LP, Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming, A relaxed cutting plane method for semi-infinite semi-definite programming, Infeasible constraint-reduced interior-point methods for linear optimization, Linear programs for constraint satisfaction problems, On improved Choi-Goldfarb solution-containing ellipsoids in linear programming, On solution-containing ellipsoids in linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Karmarkar's algorithm and the ellipsoid method
• Conical projection algorithms for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Ellipsoid Method Generates Dual Variables
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• A practicable steepest-edge simplex algorithm