Determination of optimal vertices from feasible solutions in unimodular linear programming

DOI10.1007/BF01581235zbMath0783.90074WikidataQ59592636 ScholiaQ59592636MaRDI QIDQ2366606

Romesh Saigal, Shinji Mizuno, James B. Orlin

Publication date: 30 August 1993

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

zbMATH Keywords

path followinginterior point methodsduality theoremstopping criterionunimodularprimal-dual affine scaling

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• Further Development of a Primal-Dual Interior Point Method

This page was built for publication: Determination of optimal vertices from feasible solutions in unimodular linear programming