An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables
Tomonari Kitahara (kitahara.t.abm.titech.ac.jp)
Abstract: Kitahara and Mizuno (2011a) obtained an upper bound for the number of different solutions generated by the primal simplex method with Dantzig's (the most negative) pivoting rule. In this paper, we obtain an upper bound with any pivoting rule which chooses an entering variable whose reduced cost is negative at each iteration. The bound is applied to special linear programming problems. We also get a similar bound for the dual simplex method.
Keywords: Linear programming; the number of basic solutions; pivoting rule; the simplex method.
Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )
Citation: To appear in Asia-Pacific Journal of Operational Research (APJOR)
Entry Submitted: 02/15/2012
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|