Linear programming by minimizing distances

DOI10.1007/BF01417518zbMath0746.90033OpenAlexW1977067576MaRDI QIDQ3978454

Martin Henk, Ulrich. Betke

Publication date: 25 June 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

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

zbMATH Keywords

Newton's methodpenalty methods

Mathematics Subject Classification ID

Related Items (1)

Zonotopes and the LP-Newton method

Cites Work

• A new polynomial-time algorithm for linear programming
• Projection algorithms for linear programming
• On a convex programming problem of Rozanov
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear programming by minimizing distances