Pages that link to "Item:Q1771222"
From MaRDI portal
The following pages link to A dual projective pivot algorithm for linear programming (Q1771222):
Displaying 17 items.
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Restricted vertex generation applied as a crashing procedure for linear programming (Q1086152) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- A projective simplex method for linear programming (Q1124875) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- Probing through the intersection of hyperplanes (Q1262211) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- A self-adjoint algorithm for solving linear programming problems (Q1902858) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
- (Q2990640) (← links)
- A Variant of the Dual Pivoting Rule in Linear Programming (Q4321114) (← links)