A class of linear programming problems requiring a large number of iterations

DOI10.1007/BF01436525zbMath0134.15402MaRDI QIDQ2395976

Victor Klee

Publication date: 1965

Published in: Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Related Items

A simplex-like method with bisection for linear programming¹, The complexity of linear programming, Practical finite pivoting rules for the simplex method, The simplex algorithm with the pivot rule of maximizing criterion improvement, On the Length of Monotone Paths in Polyhedra

Cites Work

• Unnamed Item
• Heights of convex polytopes
• Letter to the Editor—A Conjecture Concerning the Smallest Bound on the Iterations in Linear Programming
• On the Number of Vertices of a Convex Polytope
• Paths on Polyhedra. I
• Letter to the Editor—Examples Relating to the Simplex Method
• Diameters of Polyhedral Graphs
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
• Remarks on a previous paper