Computational study of the GDPO dual phase-1 algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1054665
- A phase-1 approach for the generalized simplex algorithm
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Analysis and implementation of a dual algorithm for constrained optimization
- A generalized dual phase-2 simplex algorithm.
- A remark on the GOP algorithm for global optimization
- An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
- A piecewise linear dual phase-1 algorithm for the simplex method
- Further study on a dual algorithm
- Dual simplex method for GUB problems
Cites work
- scientific article; zbMATH DE number 1187125 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1064581 (Why is no real title available?)
- A piecewise linear dual phase-1 algorithm for the simplex method
- Computational techniques of the simplex method
- Partitioning procedures for solving mixed-variables programming problems. Reprint
- Pivot selection methods of the Devex LP code
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Steepest-edge simplex algorithms for linear programming
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
This page was built for publication: Computational study of the GDPO dual phase-1 algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970138)
