A comparison of primal and dual methods of linear programming

DOI10.1007/BF02162086MaRDI QIDQ2525099zbMATH OpenOpenAlexFDO

Authors Victor Klee

Publication date 1966

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131742

zbMATH Keywords

operations research

Cites work

• scientific article; zbMATH DE number 3121295 (Why is no real title available?)
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3209723 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• Newton's method for convex programming and Tschebyscheff approximation
• Note on Convex Programming
• On The Number of Faces of a Convex Polytope
• On the Number of Vertices of a Convex Polytope
• Theory of Positive Linear Dependence

Cited in

(5)

• A lower bound theorem for polytope pairs
• The minimum number of faces of a simple polyhedron
• The number of faces of polytope pairs and unbounded polyhedra
• Polytope pairs and their relationship to linear programming
• Rigidity and the lower bound theorem. I

This page was built for publication: A comparison of primal and dual methods of linear programming

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