A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming

Rockafellar RT & Wets RJ-B (1984). A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-84-025

[img]
Preview
Text
WP-84-025.pdf

Download (1MB) | Preview

Abstract

A new method is proposed for solving two-stage problems in linear and quadratic stochastic programming. Such problems are dualized, and the dual, although itself of high dimension, is approximated by a sequence of quadratic programming subproblems whose dimensionality can be kept low. These subproblems correspond to maximizing the dual objective over the convex hull of finitely many dual feasible solutions. An optimizing sequence is produced for the primal problem that converges at a linear rate in the strongly quadratic case. An outer algorithm of augmented Lagrangian type can be used to introduce strongly quadratic terms, if desired.

Item Type: Monograph (IIASA Working Paper)
Research Programs: Adaption and Optimization (ADO)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:54
Last Modified: 23 Jul 2016 18:43
URI: http://pure.iiasa.ac.at/2493

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313