Implementing an affine scaling algorithm for linear programming
From MaRDI portal
(Redirected from Publication:1097168)
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- A variable-metric variant of the Karmarkar algorithm for linear programming
- An experimental approach to karmarkar’s projective method for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Convergence results and numerical experiments on a linear programming hybrid algorithm
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 3908161 (Why is no real title available?)
- scientific article; zbMATH DE number 4085412 (Why is no real title available?)
- Metabelian groups with the same finite quotients
Cited in
(9)- Generalized affine scaling algorithms for linear programming problems
- Linear scaling and the DIRECT algorithm
- Chaotic behavior of the affine scaling algorithm for linear programming
- A modified scaling algorithm for LP
- A variable-metric variant of the Karmarkar algorithm for linear programming
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
- scientific article; zbMATH DE number 1226308 (Why is no real title available?)
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions
- The affine-scaling direction for linear programming is a limit of projective-scaling directions
This page was built for publication: Implementing an affine scaling algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097168)