Pages that link to "Item:Q1312781"
From MaRDI portal
The following pages link to An exterior point simplex algorithm for (general) linear programming problems (Q1312781):
Displaying 15 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)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← 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 new efficient primal dual simplex algorithm (Q1868820) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
- (Q3712145) (← links)
- (Q4319602) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
