Pages that link to "Item:Q3673477"
From MaRDI portal
The following pages link to Nonadjacent extreme point methods for solving linear programs (Q3673477):
Displayed 10 items.
- Solving large-scale linear programs by aggregation (Q581234) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- A feasible direction method for linear programming (Q797493) (← links)
- Experiments with external pivoting (Q909578) (← links)
- Intelligent gradient search in linear programming (Q1071647) (← links)
- An external reconstruction approach (ERA) to linear programming (Q1099782) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Adjacent vertex simplex algorithms: More experimental results on random problems (Q1321806) (← links)
- A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)