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 1 2019 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
Cite this
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP. / Tano, Masaya; Miyashiro, Ryuhei; Kitahara, Tomonari.
In: Operations Research Letters, Vol. 47, No. 3, 01.05.2019, p. 151-156.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
AU - Tano, Masaya
AU - Miyashiro, Ryuhei
AU - Kitahara, Tomonari
PY - 2019/5/1
Y1 - 2019/5/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85062699370&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062699370&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2019.02.003
DO - 10.1016/j.orl.2019.02.003
M3 - Article
AN - SCOPUS:85062699370
VL - 47
SP - 151
EP - 156
JO - Operations Research Letters
JF - Operations Research Letters
SN - 0167-6377
IS - 3
ER -