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

DOI10.1007/BF01436525MaRDI QIDQ2395976zbMATH OpenFDO

Authors 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

Cites work

• scientific article; zbMATH DE number 3354790 (Why is no real title available?)
• Diameters of Polyhedral Graphs
• Heights of convex polytopes
• Letter to the Editor—A Conjecture Concerning the Smallest Bound on the Iterations in Linear Programming
• Letter to the Editor—Examples Relating to the Simplex Method
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
• On the Number of Vertices of a Convex Polytope
• Paths on Polyhedra. I
• Remarks on a previous paper

Cited in

(5)

• A simplex-like method with bisection for linear programming¹
• The complexity of linear programming
• On the length of monotone paths in polyhedra
• Practical finite pivoting rules for the simplex method
• The simplex algorithm with the pivot rule of maximizing criterion improvement

This page was built for publication: A class of linear programming problems requiring a large number of iterations

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