An improved targeted climbing algorithm for linear programs

DOI10.3934/NACO.2011.1.399zbMATH Open1242.90099OpenAlexW2076481775MaRDI QIDQ428484FDOQ428484

John Anthony Gear, Yanqun Liu, Mingfang Ding

Publication date: 22 June 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2011.1.399

Recommendations

• An Improved Successive Linear Programming Algorithm
• An efficient search direction for linear programming problems
• A strictly improving linear programming Phase I algorithm
• Improved deterministic algorithms for linear programming in low dimensions
• Improved deterministic algorithms for linear programming in low dimensions
• An improved deterministic rescaling for linear programming algorithms
• An Improved Graph Method for Linear Goal Programming
• scientific article; zbMATH DE number 6938247
• scientific article; zbMATH DE number 1047676
• Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems

zbMATH Keywords

improved targeted climbing algorithmoriginal targeted climbing algorithmsimplex methods

Mathematics Subject Classification ID

Linear programming (90C05)

This page was built for publication: An improved targeted climbing algorithm for linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428484)