Abstract
In this paper, we consider the number of simplex iterations with the steepest-edge rule for the simplex method. For a nondegenerate linear programming problem, we show two upper bounds for the number of iterations of the simplex method with the steepest-edge rule via analysis of the p-norm rule, which is a previously proposed generalization of the steepest-edge rule.
Original language | English |
---|---|
Pages (from-to) | 151-156 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 47 |
Issue number | 3 |
DOIs | |
Publication status | Published - May 2019 |
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics