Pages that link to "Item:Q1124875"
From MaRDI portal
The following pages link to A projective simplex method for linear programming (Q1124875):
Displaying 18 items.
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- A dual projective pivot algorithm for linear programming (Q1771222) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Linear updates for a single-phase projective method (Q2276876) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- A new least square algorithm for linear programming (Q2505271) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- (Q2990640) (← links)
- (Q3767122) (← links)
- An experimental approach to karmarkar’s projective method for linear programming (Q3773690) (← links)
- (Q4733659) (← links)
- The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (Q5113712) (← links)
- Combined projected gradient algorithm for linear programming (Q5481683) (← links)