KleeMintys LP and upper bounds for Dantzigs simplex method

Tomonari Kitahara, Shinji Mizuno

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


Kitahara and Mizuno (2010) [2] get two upper bounds for the number of different basic feasible solutions generated by Dantzigs simplex method. The size of the bounds highly depends on the ratio between the maximum and the minimum values of all the positive elements of basic feasible solutions. We show that the ratio for a simple variant of KleeMintys LP is equal to the number of iterations by Dantzigs simplex method for solving it.

Original languageEnglish
Pages (from-to)88-91
Number of pages4
JournalOperations Research Letters
Issue number2
Publication statusPublished - Mar 2011
Externally publishedYes

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'KleeMintys LP and upper bounds for Dantzigs simplex method'. Together they form a unique fingerprint.

Cite this