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):
Displayed 9 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)
- Recovering an optimal LP basis from an optimal dual solution (Q2480056) (← links)
- POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING (Q4650618) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING (Q5315980) (← links)