Pages that link to "Item:Q1802952"
From MaRDI portal
The following pages link to Steepest-edge simplex algorithms for linear programming (Q1802952):
Displaying 8 items.
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
- Linear programing formulations and algorithms for radiotherapy treatment planning (Q5478868) (← links)
- Primal-dual methods for sustainable harvest scheduling problems (Q5953164) (← links)
- Optimal pivot path of the simplex method for linear programming based on reinforcement learning (Q6564764) (← links)
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154) (← links)