Pages that link to "Item:Q1342078"
From MaRDI portal
The following pages link to Recovering an optimal LP basis from an interior point solution (Q1342078):
Displaying 12 items.
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- Modified fictitious play for solving matrix games and linear-programming problems (Q1919970) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition (Q2439505) (← links)
- On the uniqueness of optimal strategies in symmetric matrix games (Q2451671) (← links)
- Recovering an optimal LP basis from an optimal dual solution (Q2480056) (← links)
