A redundant Klee-Minty construction with all the redundant constraints touching the feasible region

DOI10.1016/j.orl.2008.02.004zbMath1155.90477OpenAlexW2070153042MaRDI QIDQ1003486

Eissa Nematollahi, Tamás Terlaky

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.02.004

zbMATH Keywords

interior point methodslinear optimizationredundancycentral pathKlee-Minty cube

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• A new polynomial-time algorithm for linear programming
• A simpler and tighter redundant Klee-Minty construction
• Pivot rules for linear programming: A survey on recent theoretical developments
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
• The central path visits all the vertices of the Klee–Minty cube
• Interior Point Methods for Linear Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item