Pages that link to "Item:Q2395976"
From MaRDI portal
The following pages link to A class of linear programming problems requiring a large number of iterations (Q2395976):
Displaying 5 items.
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- The simplex algorithm with the pivot rule of maximizing criterion improvement (Q2558159) (← links)
- A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- The complexity of linear programming (Q5904560) (← links)