| Article ID: | iaor20052304 |
| Country: | Netherlands |
| Volume: | 26 |
| Issue: | 1 |
| Start Page Number: | 33 |
| End Page Number: | 41 |
| Publication Date: | Feb 2000 |
| Journal: | Operations Research Letters |
| Authors: | Lawphongpanich Siriphong |
The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network flow problem is simply its linear approximation. Instead of solving the subproblem optimally, this paper demonstrates that performing one iteration of Dantzig–Wolfe decomposition is generally sufficient for SD to efficiently converge to an optimal solution.