2002-07-07Buch DOI: 10.18452/8277
Duality gaps in nonconvex stochastic optimization
We consider multistage stochastic optimization models. Logical or integrality constraints, frequently present in optimization models, limit the application of powerful convex analysis tools. Different Lagrangian relaxation schemes and the resulting decomposition approaches provide estimates of the optimal value. We formulate convex optimization models equivalent to the dual problems of the Lagrangian relaxations. Our main results compare the resulting duality gap for these decomposition schemes. Attention is paid also to programs that model large systems with loosely coupled components.
Dateien zu dieser Publikation