An algorithm for linear programming that is easy to implement

DOI10.1016/0893-9659(89)90004-9zbMath0704.90059OpenAlexW2085381620MaRDI QIDQ917443

J. C. Culioli, Vladimir A. Protopopescu

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90004-9

zbMATH Keywords

convergence

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items (1)

An algorithm for linear programming that is easy to implement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming that is easy to implement
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming

This page was built for publication: An algorithm for linear programming that is easy to implement