<mets:mets OBJID="eprint_4578" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mets="http://www.loc.gov/METS/" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mets:metsHdr CREATEDATE="2024-01-01T23:16:18Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_4578_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>Scenario-Based Stochastic Programs: Strategies for Deleting Scenarios</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">J.</mods:namePart><mods:namePart type="family">Dupacova</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>The proposed strategies for deleting scenarios are based on postoptimality analysis of the optimal value function with respect to probabilities of the included scenarios. These strategies can be used to reduce the size of the large scenario based problems or of the problems constructed in the course of specific numerical procedures, such as stochastic decomposition or scenario aggregation. &#13;
&#13;
A convex nonsmooth optimization problem is replaced by a sequence of line search problems along recursively updated rays. Convergence of the method is proved and applications indicated.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1995-02</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-95-014</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_4578"><mets:rightsMD ID="rights_eprint_4578_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong>
In self-archiving this collection of files and associated bibliographic
metadata, I grant IIASA Repository the right to store
them and to make them permanently available publicly for free on-line.
I declare that this material is my own intellectual property and I
understand that IIASA Repository does not assume any
responsibility if there is any breach of copyright in distributing these
files or metadata. (All authors are urged to prominently assert their
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its
author:</strong> I hereby declare that the collection of files and
associated bibliographic metadata that I am archiving at
IIASA Repository) is in the public domain. If this is
not the case, I accept full responsibility for any breach of copyright
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec><mets:fileGrp USE="reference"><mets:file ID="eprint_4578_4132_1" SIZE="493806" OWNERID="https://pure.iiasa.ac.at/id/eprint/4578/1/WP-95-014.pdf" MIMETYPE="application/pdf"><mets:FLocat LOCTYPE="URL" xlink:type="simple" xlink:href="https://pure.iiasa.ac.at/id/eprint/4578/1/WP-95-014.pdf"></mets:FLocat></mets:file></mets:fileGrp></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_4578_mods" ADMID="TMD_eprint_4578"><mets:fptr FILEID="eprint_4578_document_4132_1"></mets:fptr></mets:div></mets:structMap></mets:mets>