Pages that link to "Item:Q3144758"
From MaRDI portal
The following pages link to LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144758):
Displaying 4 items.
- On the number of solutions generated by the dual simplex method (Q439907) (← links)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- Klee-Minty's LP and upper bounds for Dantzig's simplex method (Q2275570) (← links)
- An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492) (← links)