Implementing an affine scaling algorithm for linear programming
From MaRDI portal
Publication:1097168
DOI10.1016/0305-0548(87)90031-1zbMath0634.90040OpenAlexW1976990008MaRDI QIDQ1097168
Tom M. Cavalier, Kenneth C. Schall
Publication date: 1987
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(87)90031-1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Convergence results and numerical experiments on a linear programming hybrid algorithm
- An experimental approach to karmarkar’s projective method for linear programming
- A variable-metric variant of the Karmarkar algorithm for linear programming
- Metabelian groups with the same finite quotients
This page was built for publication: Implementing an affine scaling algorithm for linear programming