On the number of solutions generated by the dual simplex method

DOI10.1016/J.ORL.2012.01.004MaRDI QIDQ439907zbMATHOpenAlexFDO

Authors Tomonari Kitahara, Shinji Mizuno

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)

Recommendations

• On the number of solutions generated by Dantzig's simplex method for LP with bounded variables
• An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables
• A bound for the number of different basic solutions generated by the simplex method
• On the number of solutions generated by the simplex method for LP
• Lower bounds for the maximum number of solutions generated by the simplex method

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• 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
• On the number of solutions generated by Dantzig's simplex method for LP with bounded variables
• The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate

Cited in

(7)

• A bound for the number of different basic solutions generated by the simplex method
• On the number of solutions generated by Dantzig's simplex method for LP with bounded variables
• Short simplex paths in lattice polytopes
• An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables
• The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
• A primal-simplex based Tardos' algorithm
• On the number of solutions generated by the simplex method for LP

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

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