An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables

Tomonari Kitahara, Shinji Mizuno

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish
Article number1340012
JournalAsia-Pacific Journal of Operational Research
Volume30
Issue number3
DOIs
Publication statusPublished - Jun 1 2013
Externally publishedYes

Fingerprint

Simplex method
Upper bound
Costs
Linear programming

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research

Cite this

@article{a6e553a2d8ae421aa0b28618470f2a1a,
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.",
author = "Tomonari Kitahara and Shinji Mizuno",
year = "2013",
month = "6",
day = "1",
doi = "10.1142/S0217595913400125",
language = "English",
volume = "30",
journal = "Asia-Pacific Journal of Operational Research",
issn = "0217-5959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "3",

}

TY - JOUR

T1 - An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables

AU - Kitahara, Tomonari

AU - Mizuno, Shinji

PY - 2013/6/1

Y1 - 2013/6/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1142/S0217595913400125

DO - 10.1142/S0217595913400125

M3 - Article

VL - 30

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 3

M1 - 1340012

ER -