LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))
-
- Kitahara Tomonari
- Tokyo Institute of Technology
-
- Mizuno Shinji
- Tokyo Institute of Technology
書誌事項
- タイトル別名
-
- 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.
収録刊行物
-
- 日本オペレーションズ・リサーチ学会論文誌
-
日本オペレーションズ・リサーチ学会論文誌 54 (4), 191-200, 2011
公益社団法人 日本オペレーションズ・リサーチ学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679086610304
-
- NII論文ID
- 110008897241
-
- NII書誌ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL書誌ID
- 023392111
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- JaLC
- NDLサーチ
- Crossref
- CiNii Articles
- KAKEN
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可
