Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
From MaRDI portal
Publication:723482
DOI10.1007/S11590-018-1276-4zbMATH Open1402.90085OpenAlexW2804559392MaRDI QIDQ723482FDOQ723482
Yoshio Sano, Takahito Kuno, Takahiro Tsuruda
Publication date: 31 July 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1276-4
Recommendations
- A bound for the number of different basic solutions generated by the simplex method
- Klee-Minty's LP and upper bounds for Dantzig's simplex method
- On the number of solutions generated by Dantzig's simplex method for LP with bounded variables
- On the number of solutions generated by the simplex method for LP
- Lower bounds for the maximum number of solutions generated by the simplex method
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Title not available (Why is that?)
- Polynomial algorithms in linear programming
- The maximum numbers of faces of a convex polytope
- Pivot rules for linear programming: A survey on recent theoretical developments
- The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
- A bound for the number of different basic solutions generated by the simplex method
- Title not available (Why is that?)
- The Complexity of the Simplex Method
- On Simplex Pivoting Rules and Complexity Theory
Cited In (4)
Uses Software
This page was built for publication: Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723482)
