Pages that link to "Item:Q5955478"
From MaRDI portal
The following pages link to An efficient search direction for linear programming problems (Q5955478):
Displaying 6 items.
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- Comments on ''An efficient search direction for linear programming problems'' by H. Luh and R. Tsaih. (Q1413819) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- An improved initial basis for the simplex algorithm (Q2387247) (← links)
