Refine
Year of publication
- 2011 (1)
Document Type
- ZIB-Report (1)
Language
- English (1)
Has Fulltext
- yes (1)
Is part of the Bibliography
- no (1)
Keywords
- Network Design (1) (remove)
Institute
We present and prove a theorem which gives the optimal dual vector for which a Lagrangian dual problem in the Single Period Design Problem (SPDP) is maximized.
Furthermore we give a straightforward generalization to the Multi-Period Design Problem (MPDP). Based on the optimal dual values derived we compute the solution of the Lagrangian relaxation and compare it
with the linear relaxation and optimal IP values.