Generation of degenerate linear programming problems
From MaRDI portal
Publication:2483038
Recommendations
Cites work
Cited in
(11)- Prior reduced fill-in in solving equations in interior point algorithms
- A computational study of redundancy in randomly generated polytopes
- A new linesearch method for quadratically constrained convex programming
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique
- A simple complexity proof for a polynomial-time linear programming algorithm
- GENGUB: A generator for linear programs with generalized upper bound constraints
- Erratum: Probabilistic models for linear programming
- scientific article; zbMATH DE number 4112378 (Why is no real title available?)
- On monotonicity in the scaled potential algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- The modified barrier function method for linear programming and its extensions
This page was built for publication: Generation of degenerate linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483038)