The following pages link to (Q4733659):
Displaying 15 items.
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A projective algorithm for linear programming with no regularity condition (Q1200753) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- A self-adjoint algorithm for solving linear programming problems (Q1902858) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- (Q2990640) (← links)
- A Centered Projective Algorithm for Linear Programming (Q3211107) (← links)
- An experimental approach to karmarkar’s projective method for linear programming (Q3773690) (← links)
- The Projective SUMT Method for Convex Programming (Q3830821) (← links)
- Alternative Approaches to Feasibility in Projective Methods for Linear Programming (Q4030927) (← links)
