On the number of solutions generated by the dual simplex method

Tomonari Kitahara, Shinji Mizuno

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with Dantzig's rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (in press) [3] for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.

Original languageEnglish
Pages (from-to)172-174
Number of pages3
JournalOperations Research Letters
Volume40
Issue number3
DOIs
Publication statusPublished - May 1 2012
Externally publishedYes

Fingerprint

Dual Method
Simplex Method
Number of Solutions
Polynomials
Maximum Flow
Upper bound
Polynomial
Simplex method

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

On the number of solutions generated by the dual simplex method. / Kitahara, Tomonari; Mizuno, Shinji.

In: Operations Research Letters, Vol. 40, No. 3, 01.05.2012, p. 172-174.

Research output: Contribution to journalArticle

@article{cd361c8be97f46a1ba6bd7118dd7d08c,
title = "On the number of solutions generated by the dual simplex method",
abstract = "In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with Dantzig's rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (in press) [3] for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.",
author = "Tomonari Kitahara and Shinji Mizuno",
year = "2012",
month = "5",
day = "1",
doi = "10.1016/j.orl.2012.01.004",
language = "English",
volume = "40",
pages = "172--174",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - On the number of solutions generated by the dual simplex method

AU - Kitahara, Tomonari

AU - Mizuno, Shinji

PY - 2012/5/1

Y1 - 2012/5/1

N2 - In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with Dantzig's rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (in press) [3] for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.

AB - In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with Dantzig's rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (in press) [3] for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.

UR - http://www.scopus.com/inward/record.url?scp=84859427974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859427974&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2012.01.004

DO - 10.1016/j.orl.2012.01.004

M3 - Article

AN - SCOPUS:84859427974

VL - 40

SP - 172

EP - 174

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 3

ER -