Interior-point algorithms for Dantzig and Wolfe decomposition principle
From MaRDI portal
The authors present algorithms to solve the problem originated from the application of the Dantzig and Wolfe decomposition principle to linear programming problems. One algorithm requires the sub-problems completely solved at each iteration and the other uses sub-optimal solutions. Also, is presented a two-cut approach to save the excessive computation time in the restarting phase.NEWLINENEWLINEFor the entire collection see [Zbl 0968.00020].
Recommendations
- The decomposition principle and algorithms for linear programs under interior point method. I, II
- The decomposition principle and algorithms for linear programming
- An interior point method in Dantzig-Wolfe decomposition
- scientific article; zbMATH DE number 3961340
- Numerical behavior of LP algorithms based upon the decomposition principle
Cited in
(10)- An interior point method in Dantzig-Wolfe decomposition
- Interior-point methods with decomposition for solving large-scale linear programs
- The decomposition principle and algorithms for linear programs under interior point method. I, II
- Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition
- Algorithm 928: A general, parallel implementation of Dantzig-Wolfe decomposition
- A dantzig-wolfe decomposition variant equivalent to basis factorization
- A Parametric Subproblem for Dual Methods in Decomposition
- A simple modification of dantzig-wolfe decomposition
- The decomposition principle and algorithms for linear programming
This page was built for publication: Interior-point algorithms for Dantzig and Wolfe decomposition principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768066)
