A new family of exponential LP problems

DOI10.1016/0377-2217(87)90277-3zbMath0634.90041OpenAlexW2010160709MaRDI QIDQ1097169

Jens Clausen

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90277-3

zbMATH Keywords

computational complexitysimplex methodredundancypivoting ruledegenerate LP problemKlee-Minty problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (1)

A strictly improving linear programming Phase I algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Worst case behavior of the steepest edge simplex method
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• On the average number of steps of the simplex method of linear programming
• Computational complexity of parametric linear programming
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Theoretical Properties of the Network Simplex Method

This page was built for publication: A new family of exponential LP problems