On the number of solutions generated by the dual simplex method

DOI10.1016/j.orl.2012.01.004zbMath1252.90044OpenAlexW1964500497MaRDI QIDQ439907

Shinji Mizuno, Tomonari Kitahara

Publication date: 17 August 2012

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

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

zbMATH Keywords

maximum flow problembasic feasible solutionsdual simplex method

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (4)

On the Number of Solutions Generated by the Simplex Method for LP ⋮ A primal-simplex based Tardos' algorithm ⋮ The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption ⋮ Short simplex paths in lattice polytopes

Cites Work

• A bound for the number of different basic solutions generated by the simplex method
• Klee-Minty's LP and upper bounds for Dantzig's simplex method
• The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of solutions generated by the dual simplex method