Pages that link to "Item:Q2846492"
From MaRDI portal
The following pages link to An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492):
Displaying 7 items.
- On the number of solutions generated by the dual simplex method (Q439907) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- A bound for the number of different basic solutions generated by the simplex method (Q1942281) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
- On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)
- 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) (← links)