LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))

書誌事項

タイトル別名
  • LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD

この論文をさがす

説明

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 in this paper are shown in Kitahara and Mizuno [4] as a quick report without proof. They present a simple variant of Klee-Minty's LP 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.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (5)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ