The following pages link to (Q4319602):
Displaying 11 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- An exterior point linear programming method based on inclusive normal cones (Q620021) (← links)
- Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
- An external reconstruction approach (ERA) to linear programming (Q1099782) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- An exterior point method for the convex programming problem (Q1321136) (← links)
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- (Q3712145) (← links)
- On first experiences with the implementation of a Newton based linear programming approach (Q5948071) (← links)
