Pages that link to "Item:Q2483038"
From MaRDI portal
The following pages link to Generation of degenerate linear programming problems (Q2483038):
Displaying 10 items.
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- The modified barrier function method for linear programming and its extensions (Q918138) (← links)
- Prior reduced fill-in in solving equations in interior point algorithms (Q1197902) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- A new linesearch method for quadratically constrained convex programming (Q1342277) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
- A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548) (← links)
- Erratum: Probabilistic models for linear programming (Q2757565) (← links)
- (Q3835294) (← links)