@article{oai:tsukuba.repo.nii.ac.jp:00047769,
 author = {久野, 誉人 and 佐野, 良夫 and Kuno, Takahito and Sano, Yoshio and Tsuruda, Takahiro},
 issue = {5},
 journal = {Optimization letters},
 month = {Jul},
 note = {This paper addresses an upper bound derived by Kitahara and Mizuno (Math Program A 137:579–586, 2013) on the number of basic feasible solutions of a linear program generated with the simplex algorithm. Their bound includes two parameters δ and γ, which are respectively the minimum and the maximum values of positive components in all basic feasible solutions. We show that δ is NP-hard to determine while γ can be computed in polynomial time. We also report some numerical results using alternative parameters for δ and γ.},
 pages = {933--943},
 title = {Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm},
 volume = {12},
 year = {2018}
}