The long step rule in the bounded-variable dual simplex method: Numerical experiments
From MaRDI portal
Recommendations
- A generalized dual phase-2 simplex algorithm.
- The dual simplex method, techniques for a fast and stable implementation
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- A piecewise linear dual phase-1 algorithm for the simplex method
Cited in
(10)- A two-phase support method for solving linear programs: numerical experiments
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Primal-dual method for solving a linear-quadratic multi-input optimal control problem
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Dual simplex method for GUB problems
- Gauss–Newton Methods for Robust Parameter Estimation
- A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
- Robustness aspects in parameter estimation, optimal design of experiments and optimal control
- A hybrid direction algorithm for solving linear programs
This page was built for publication: The long step rule in the bounded-variable dual simplex method: Numerical experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1397068)