A hybrid direction algorithm for solving linear programs

DOI10.1080/00207160.2014.890188zbMath1310.90069OpenAlexW2091936135MaRDI QIDQ4983278

Mohand Bentobache, Mohand Ouamer Bibi

Publication date: 25 March 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingcomputational experimentsadaptive methodhybrid directionoptimality estimate

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ Primal-dual method for solving a linear-quadratic multi-input optimal control problem ⋮ A hybrid direction algorithm for solving optimal control problems ⋮ Direct method to solve linear-quadratic optimal control problems

Uses Software

• Matlab

Cites Work

• Unnamed Item
• An effective generalization of the direct support method
• Optimal feedback control
• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• A basis-defiency-allowing variation of the simplex method for linear programming
• An efficient simplex type algorithm for sparse and dense linear programs.
• A two-phase support method for solving linear programs: numerical experiments
• Dual support method for solving convex quadratic programs
• Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control

This page was built for publication: A hybrid direction algorithm for solving linear programs