AN UPPER BOUND FOR THE NUMBER OF DIFFERENT SOLUTIONS GENERATED BY THE PRIMAL SIMPLEX METHOD WITH ANY SELECTION RULE OF ENTERING VARIABLES

DOI10.1142/S0217595913400125zbMath1273.90119OpenAlexW2165528967MaRDI QIDQ2846492

Tomonari Kitahara, Shinji Mizuno

Publication date: 5 September 2013

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595913400125

zbMATH Keywords

linear programmingpivoting rulethe number of basic solutionsthe simplex method

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Extreme-point and pivoting methods (90C49)

Related Items (4)

On the Number of Solutions Generated by the Simplex Method for LP ⋮ Colorful linear programming, Nash equilibrium, and pivots ⋮ A double-pivot simplex algorithm and its upper bounds of the iteration numbers ⋮ Steepest-edge rule and its number of simplex iterations for a nondegenerate LP

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

This page was built for publication: AN UPPER BOUND FOR THE NUMBER OF DIFFERENT SOLUTIONS GENERATED BY THE PRIMAL SIMPLEX METHOD WITH ANY SELECTION RULE OF ENTERING VARIABLES