<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T01:05:23Z</responseDate>
  <request identifier="63" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:63</identifier>
        <datestamp>2024-03-06T11:06:10Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Assessing Solution Quality in Stochastic Programs</dc:title>
          <dc:creator>Morton, David P.</dc:creator>
          <dc:creator>Bayraksan, Guzin</dc:creator>
          <dc:subject>stochastic programming</dc:subject>
          <dc:subject>Monte Carlo simulation</dc:subject>
          <dc:description>Assessing whether a solution is of high quality&#13;
(optimal or near optimal) is a fundamental &#13;
question in optimization. We develop Monte Carlo&#13;
sampling-based procedures for assessing solution &#13;
quality in stochastic programs. Quality is defined&#13;
via the optimality gap and our procedures' output&#13;
is a confidence interval on this gap. We review a&#13;
multiple-replications procedure and then present a&#13;
result that justifies a computationally simplified&#13;
single-replication procedure. Even though the&#13;
single replication procedure is computationally&#13;
significantly less demanding, the resulting&#13;
confidence interval may have low coverage for&#13;
small sample sizes on some problems. We provide&#13;
variants of this procedure and provide preliminary&#13;
guidelines for selecting a candidate solution.&#13;
Both are designed to improve the basic procedure's&#13;
performance.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>David P. Morton and Guzin Bayraksan</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.05031.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-638</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.6</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
