A comparison of primal and dual methods of linear programming

DOI10.1007/BF02162086zbMath0149.16601OpenAlexW2076724178MaRDI QIDQ2525099

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

Related Items (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

Cites Work

• Newton's method for convex programming and Tschebyscheff approximation
• On The Number of Faces of a Convex Polytope
• On the Number of Vertices of a Convex Polytope
• Note on Convex Programming
• Theory of Positive Linear Dependence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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