Pages that link to "Item:Q1119474"
From MaRDI portal
The following pages link to Computational behavior of a feasible direction method for linear programming (Q1119474):
Displaying 7 items.
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- Experiments with external pivoting (Q909578) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- Pure adaptive search in Monte Carlo optimization (Q1119467) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Computer Codes for the Analysis of Infeasible Linear Programs (Q4868828) (← links)
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154) (← links)