A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments

DOI10.1007/978-3-319-18161-5_28MaRDI QIDQ5356997zbMATH OpenOpenAlexFDO

Authors Mohand Bentobache, Mohand Ouamer Bibi

Publication date 12 September 2017

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18161-5_28

zbMATH Keywords

linear programmingcomputational experimentsadaptive methodhybrid directionsuboptimality estimatelong step rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Linear-quadratic optimal control problems (49N10)

Recommendations

• A hybrid direction algorithm for solving linear programs
• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• scientific article; zbMATH DE number 934836
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• An adaptive long step interior point algorithm for linear optimization
• scientific article; zbMATH DE number 1182576
• A long-step, cutting plane algorithm for linear and convex programming
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

Cited in

(4)

• A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION
• A hybrid method for linear programming
• A hybrid direction algorithm for solving a convex quadratic problem
• A hybrid direction algorithm for solving linear programs

This page was built for publication: A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments

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