Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema

DOI10.1080/02331939308843871zbMath0818.90066OpenAlexW2036567359MaRDI QIDQ3835654

No author found.

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843871

zbMATH Keywords

degenerate linear programmingsymmetric affine scaling algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema ⋮ A logarithm barrier method for linear programming ⋮ Higher-order derivatives in linear and quadratic programming ⋮ On the symmetric affiine scaling algorithm for line programming^*

Cites Work

• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• An optimal-basis identification technique for interior-point linear programming algorithms
• An implementation of Karmarkar's algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema

This page was built for publication: Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema