Pages that link to "Item:Q1612514"
From MaRDI portal
The following pages link to A phase-1 approach for the generalized simplex algorithm (Q1612514):
Displaying 12 items.
- A linear programming decomposition focusing on the span of the nondegenerate columns (Q319585) (← links)
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← links)
- A method to improve integer linear programming problem with branch-and-bound procedure (Q849748) (← links)
- Computational study of the GDPO dual phase-1 algorithm (Q970138) (← links)
- A general phase-I method in linear programming (Q1069441) (← links)
- An improved general Phase-I method in linear programming (Q1107440) (← links)
- A piecewise linear dual phase-1 algorithm for the simplex method (Q1410240) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- Phase I cycling under the most-obtuse-angle pivot rule (Q2484337) (← links)
- A slight modification of the first phase of the simplex algorithm (Q5259328) (← links)