Name
Title | ||
|---|---|---|
An Upper Bound for the Number of Different solutions Generated by the Primal Simplex Method with any Selection Rule of entering Variables. |
Abstract | ||
|---|---|---|
Recently, Kitahara, and Mizuno derived 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 upper bound is applied to a linear programming problem with a totally unimodular matrix. We also obtain a similar upper bound for the dual simplex method. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1142/S0217595913400125 | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH |
Keywords | DocType | Volume |
Linear programming,the number of basic solutions,pivoting rule,the simplex method | Journal | 30 |
Issue | ISSN | Citations |
SP3 | 0217-5959 | 1 |
PageRank | References | Authors |
0.36 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomonari Kitahara | 1 | 24 | 6.61 |
| Shinji Mizuno | 2 | 792 | 153.37 |