A hybrid direction algorithm for solving linear programs
From MaRDI portal
Recommendations
- A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
- A hybrid direction algorithm for solving a convex quadratic problem
- A hybrid method for linear programming
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- An efficient search direction for linear programming problems
Cites work
- A basis-defiency-allowing variation of the simplex method for linear programming
- A two-phase support method for solving linear programs: numerical experiments
- An effective generalization of the direct support method
- An efficient simplex type algorithm for sparse and dense linear programs.
- Dual support method for solving convex quadratic programs
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Optimal feedback control
- Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
Cited in
(8)- Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
- Direct method to solve linear-quadratic optimal control problems
- Primal-dual method for solving a linear-quadratic multi-input optimal control problem
- A hybrid direction algorithm for solving a convex quadratic problem
- scientific article; zbMATH DE number 4158377 (Why is no real title available?)
- A hybrid direction algorithm for solving optimal control problems
- A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
This page was built for publication: A hybrid direction algorithm for solving linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983278)
