A projective simplex method for linear programming
From MaRDI portal
Publication:1124875
DOI10.1016/S0024-3795(99)00010-5zbMATH Open0961.90061OpenAlexW2086095490WikidataQ114850251 ScholiaQ114850251MaRDI QIDQ1124875FDOQ1124875
Publication date: 29 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(99)00010-5
Cited In (15)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combined projected gradient algorithm for linear programming
- A projective simplex algorithm using LU decomposition
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
- Efficient nested pricing in the simplex algorithm
- A new least square algorithm for linear programming
- An affine-scaling pivot algorithm for linear programming
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- A combined phase I-phase II projective algorithm for linear programming
- An experimental approach to karmarkar’s projective method for linear programming
- A phase-1 approach for the generalized simplex algorithm
- Linear updates for a single-phase projective method
- A primal deficient-basis simplex algorithm for linear programming
Recommendations
- A dual projective simplex method for linear programming 👍 👎
- A dual projective pivot algorithm for linear programming 👍 👎
- A projective simplex algorithm using LU decomposition 👍 👎
- A Revised Dual Projective Pivot Algorithm for Linear Programming 👍 👎
- Karmarkar's projective method for linear programming: a computational survey 👍 👎
This page was built for publication: A projective simplex method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124875)
