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

2493 22 2538 4 5031 document 2538 WP-84-025.pdf application/pdf 8a5ec20245af9bf72862828c6835dd99 MD5 1180107 2016-01-15 01:54:59 https://pure.iiasa.ac.at/id/eprint/2493/1/WP-84-025.pdf 2493 1 1 text en public

WP-84-025.pdf

22 0a7362b8dfb71666b5202b70ecd6017bdaaf976e 20777 2 32507 document 20777 lightbox.jpg image/png 5b48e2efca1d9aaa2a18fef4ed6e57df MD5 16631 2016-01-15 15:15:05 https://pure.iiasa.ac.at/id/eprint/2493/2/lightbox.jpg 2493 2 2 image/png other Thumbnails conversion from text to thumbnail_lightbox en public

lightbox.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/islightboxThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2538 20778 2 32508 document 20778 preview.jpg image/png 95a8c1c08d7a0116bc0dc5c918054bef MD5 7153 2016-01-15 15:15:06 https://pure.iiasa.ac.at/id/eprint/2493/3/preview.jpg 2493 3 3 image/png other Thumbnails conversion from text to thumbnail_preview en public

preview.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/ispreviewThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2538 20779 2 32509 document 20779 medium.jpg image/png 01fdf89b35be272c06179a75b891860f MD5 2040 2016-01-15 15:15:07 https://pure.iiasa.ac.at/id/eprint/2493/4/medium.jpg 2493 4 4 image/png other Thumbnails conversion from text to thumbnail_medium en public

medium.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/ismediumThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2538 20780 2 32510 document 20780 small.jpg image/png 49fae0d3a219acf46b5c774e1de12b6e MD5 957 2016-01-15 15:15:08 https://pure.iiasa.ac.at/id/eprint/2493/5/small.jpg 2493 5 5 image/png other Thumbnails conversion from text to thumbnail_small en public

small.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/issmallThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2538 20781 1 32511 document 20781 indexcodes.txt text/x-c++ 6ecf6cc75193b66b312346cfe9b23792 MD5 9992 2016-01-15 15:15:10 https://pure.iiasa.ac.at/id/eprint/2493/6/indexcodes.txt 2493 6 6 text/x-c++ other Generate index codes conversion from text to indexcodes en public

indexcodes.txt

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isIndexCodesVersionOf https://pure.iiasa.ac.at/id/document/2538 82350 2 231112 document 82350 WP-84-025.pdf application/pdf 5b186354a05027fa5d92079405831ea6 MD5 1879149 2018-03-14 09:30:44 https://pure.iiasa.ac.at/id/eprint/2493/7/WP-84-025.pdf 2493 7 7 application/pdf other Coversheet version en public

WP-84-025.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2538 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/2538 archive 351 disk0/00/00/24/93 2016-01-15 01:54:59 2021-08-27 17:12:00 2016-01-15 01:54:59 monograph show 2 Rockafellar R.T. AL0338 Wets R.J.-B. AL1370 A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming pub iis_met prog_ado 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. 1984-04 published WP-84-025 WP-84-025 2336 2512 public working_paper IIASA, Laxenburg, Austria 33 FALSE info:eu-repo/semantics/book