On the Number of Solutions Generated by the Simplex Method for LP

DOI10.1007/978-3-662-43404-8_4zbMath1327.90104OpenAlexW215256906MaRDI QIDQ2948780

Tomonari Kitahara, Shinji Mizuno

Publication date: 6 October 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43404-8_4

zbMATH Keywords

linear programmingpivotingbasic feasible solutionsthe simplex method

Mathematics Subject Classification ID

Linear programming (90C05) Markov and semi-Markov decision processes (90C40)

Related Items (1)

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of solutions generated by the dual simplex method
• The Hirsch conjecture is true for (0,1)-polytopes
• 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
• AN UPPER BOUND FOR THE NUMBER OF DIFFERENT SOLUTIONS GENERATED BY THE PRIMAL SIMPLEX METHOD WITH ANY SELECTION RULE OF ENTERING VARIABLES
• The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
• New Finite Pivoting Rules for the Simplex Method

This page was built for publication: On the Number of Solutions Generated by the Simplex Method for LP