A Revised Dual Projective Pivot Algorithm for Linear Programming
From MaRDI portal
Recommendations
Cited in
(15)- A projective simplex method for linear programming
- A dual projective simplex method for linear programming
- Book review of: P.-Q. Pan, Linear programming computation
- A dual projective pivot algorithm for linear programming
- A new efficient primal dual simplex algorithm
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
- A primal deficient-basis simplex algorithm for linear programming
- An affine-scaling pivot algorithm for linear programming
- A linear programming decomposition focusing on the span of the nondegenerate columns
- The positive edge pricing rule for the dual simplex
- scientific article; zbMATH DE number 1226308 (Why is no real title available?)
- A Variant of the Dual Pivoting Rule in Linear Programming
- scientific article; zbMATH DE number 1546510 (Why is no real title available?)
- Improving a primal–dual simplex-type algorithm using interior point methods
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
This page was built for publication: A Revised Dual Projective Pivot Algorithm for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317549)