<ctx:context-object xsi:schemaLocation="info:ofi/fmt:xml:xsd:ctx http://www.openurl.info/registry/docs/info:ofi/fmt:xml:xsd:ctx" timestamp="2021-08-27T17:15:24Z" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx" xmlns:xsi="http://www.w3.org/2001/XML"><ctx:referent><ctx:identifier>info:oai:pure.iiasa.ac.at:4589</ctx:identifier><ctx:metadata-by-val><ctx:format>info:ofi/fmt:xml:xsd:oai_dc</ctx:format><ctx:metadata><oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/">
        <dc:relation>https://pure.iiasa.ac.at/id/eprint/4589/</dc:relation>
        <dc:title>On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse</dc:title>
        <dc:creator>Pflug, G.C.</dc:creator>
        <dc:creator>Ruszczynski, A.</dc:creator>
        <dc:creator>Schultz, R.</dc:creator>
        <dc:description>Integrals of optimal values of random linear programming problems depending on a finite dimensional parameter are approximated by using empirical distributions instead of the original measure. Uniform convergence of the approximations is proved under fairly broad conditions allowing non-convex or discontinuous dependence on the parameter value and random size of the linear programming problem.</dc:description>
        <dc:publisher>WP-95-003</dc:publisher>
        <dc:date>1995-01</dc:date>
        <dc:type>Monograph</dc:type>
        <dc:type>NonPeerReviewed</dc:type>
        <dc:format>text</dc:format>
        <dc:language>en</dc:language>
        <dc:identifier>https://pure.iiasa.ac.at/id/eprint/4589/1/WP-95-003.pdf</dc:identifier>
        <dc:identifier>  Pflug, G.C. &lt;https://pure.iiasa.ac.at/view/iiasa/229.html&gt; ORCID: https://orcid.org/0000-0001-8215-3550 &lt;https://orcid.org/0000-0001-8215-3550&gt;, Ruszczynski, A. &lt;https://pure.iiasa.ac.at/view/iiasa/1544.html&gt;, &amp; Schultz, R.  (1995).  On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse.   IIASA Working Paper. IIASA, Laxenburg, Austria: WP-95-003     </dc:identifier></oai_dc:dc></ctx:metadata></ctx:metadata-by-val></ctx:referent></ctx:context-object>