Skip to main content
SpringerLink
Log in

Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

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 \(\delta \) and \(\gamma \), which are respectively the minimum and the maximum values of positive components in all basic feasible solutions. We show that \(\delta \) is NP-hard to determine while \(\gamma \) can be computed in polynomial time. We also report some numerical results using alternative parameters for \(\delta \) and \(\gamma \).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adler, I., Papadimitriou, C., Rubinstein, A.: On simplex pivoting rules and complexity theory. In: Proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, pp. 13–24 (2014)

  2. Chvátal, V.: Linear Programming. WH Freeman, New York (1983)

    MATH  Google Scholar 

  3. COIN-OR: Linear Programming Solver. https://projects.coin-or.org/Clp (2012)

  4. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)

    Book  MATH  Google Scholar 

  5. Fearnley, J., Savani, R.: The complexity of the simplex method. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC’15), pp. 201–208 (2015)

  6. Garey, M.R., Johnson, D.V.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New York (1979)

    MATH  Google Scholar 

  7. Karmarkar, N.: A new polynomial algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  9. Khachiyan, L.G.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20, 53–72 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kitahara, T., Mizuno, S.: A bound for the number of different basic solutions generated by the simplex method. Math. Program. A 137, 579–586 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kitahara, T., Mizuno, S., Matsui, T.: On the number of solutions generated by Dantzig’s simplex method for LP with bounded variables. Pac. J. Optim. 8, 447–455 (2012)

    MathSciNet  MATH  Google Scholar 

  12. Littman, M.L., Dean, T.L., Kaelbling, L.P.: On the complexity of solving Markov decision problems. In: Proceedings of the eleventh Annual Conference on Uncertainty in Artificial Intelligence (UAI’95), pp. 394–402 (1995)

  13. McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17, 179–184 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  14. Netlib: Netlib Collection of LP Problems in MPS Format. http://www.netlib.org/lp/data (1988)

  15. Terlaky, T., Zhang, S.: Pivot rules for linear programming: a survey on recent theoretical developments. Ann. Oper. Res. 46, 203–233 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ye, Y.: The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate. Math. Oper. Res. 36, 593–603 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Author notes

  1. Takahiro Tsuruda

    Present address: Cybozu, Inc., Tokyo, Japan

Authors and Affiliations

  1. Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, 305-8573, Japan

    Takahito Kuno, Yoshio Sano & Takahiro Tsuruda

Authors
  1. Takahito Kuno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshio Sano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takahiro Tsuruda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Takahito Kuno.

Additional information

Takahito Kuno: Partially supported by a Grant-in-Aid for Scientific Research (C) 16K00028 from the Japan Society for the Promotion of Sciences. Yoshio Sano: Partially supported by a Grant-in-Aid for Young Scientists (B) 15K20885 from the Japan Society for the Promotion of Sciences.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kuno, T., Sano, Y. & Tsuruda, T. Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm. Optim Lett 12, 933–943 (2018). https://doi.org/10.1007/s11590-018-1276-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1276-4

Keywords

Search

Navigation