The Constrained Gradient Method of Linear Programming
From MaRDI portal
Cited in
(6)- Intelligent gradient search in linear programming
- On a socioeconomic mathematical model and its calibration
- Dealing with degeneracy in reduced gradient algorithms
- A Lipschitz constant associated with lemke's closest-point principle
- A class of methods for linear programming
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
This page was built for publication: The Constrained Gradient Method of Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3849453)