Interior-point algorithms for Dantzig and Wolfe decomposition principle (Q2768066)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1698957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interior-point algorithms for Dantzig and Wolfe decomposition principle |
scientific article; zbMATH DE number 1698957 |
Statements
10 October 2002
0 references
large-scale problem
0 references
interior point
0 references
analytic center
0 references
cutting plane
0 references
Interior-point algorithms for Dantzig and Wolfe decomposition principle (English)
0 references
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].
0 references
0.8629794716835022
0 references
0.8307204842567444
0 references
0.827646791934967
0 references
0.8148750066757202
0 references
