| edoc-Server der Humboldt-Universität zu Berlin |
| Author(s): |
Darinka Dentcheva, Stevens Institute of Technology Werner Römisch, Humboldt-University Berlin | Title: | Duality gaps in nonconvex stochastic optimization |
| Date of Acceptance: | 07.07.2002 |
| Submission Date: | 10.06.2002 |
| Series Title: |
Stochastic Programming E-Print Series (SPEPS) |
| Editors: | Julie L. Higle; Werner Römisch; Surrajeet Sen |
| Complete Preprint: |
pdf
(urn:nbn:de:kobv:11-10058508)
ps (urn:nbn:de:kobv:11-10058510) |
| Keywords (eng): | Lagrangian relaxation, decomposition, Stochastic programming, mixed-integer, nonconvex, duality gap |
| Metadata export:
|
Endnote Bibtex |
| print on demand:
|
|
| Diese Seite taggen:
|
| Abstract (eng): | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 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. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Access Statistics:
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly. To see the detailled access numbers please move the mouse pointer over the single bars of the digaram. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gesamtzahl der Zugriffe seit May 2011:
|
|
| |||