Lower bounds for the maximum number of solutions generated by the simplex method

Tomonari Kitahara, Shinji Mizuno

Research output: Contribution to journalArticle

2 Citations (Scopus)


Kitahara and Mizuno [3] get upper bounds for the maximum number of different basic feasible solutions generated by the simplex method with the most negative pivoting rule. In this paper, we obtain lower bounds of the maximum number to show how tight the upper bounds are. Part of the results ffi this paper are shown in Kitahara arid Mizuno [4] as a quick report without proof. They present a simple variant of Klee-Minty's EP and get a lower bound. In this paper, we explain and prove the properties of the variant more precisely. We also show a new lower bound by using a simple example of LP.

Original languageEnglish
Pages (from-to)191-200
Number of pages10
JournalJournal of the Operations Research Society of Japan
Issue number4
Publication statusPublished - Jan 1 2011
Externally publishedYes


All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this