Linear programming by minimizing distances

DOI10.1007/BF01417518MaRDI QIDQ3978454zbMATH OpenOpenAlexFDO

Authors Martin Henk, Ulrich. Betke

Publication date 25 June 1992

Published in 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

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

Recommendations

• New algorithms for linear programming
• scientific article; zbMATH DE number 4062817
• Las Vegas algorithms for linear and integer programming when the dimension is small
• A method of Euclidean centers

Cites work

• scientific article; zbMATH DE number 3687182 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• A new polynomial-time algorithm 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
• Projection algorithms for linear programming

Cited in

(1)

• Zonotopes and the LP-Newton method

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

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