A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="http://www.ijocta.org/index.php/files/article/download/1001/353">the original URL</a>. The file type is <code>application/pdf</code>.
Conic reformulations for Kullback-Leibler divergence constrained distributionally robust optimization and applications
<span title="2021-04-19">2021</span>
<i title="International Journal of Optimization and Control: Theories and Applications">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oool3hb75vfp5l6rjw4kjjqa64" style="color: black;">An International Journal of Optimization and Control: Theories & Applications</a>
</i>
Preserved Fulltext
In this paper, we consider a Kullback-Leibler divergence constrained distributionally robust optimization model. This model considers an ambiguity set that consists of all distributions whose Kullback-Leibler divergence to an empirical distribution is bounded. Utilizing the fact that this divergence measure has an exponential cone representation, we obtain the robust counterpart of the Kullback-Leibler divergence constrained distributionally robust optimization problem as a dual exponential
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11121/ijocta.01.2021.001001">doi:10.11121/ijocta.01.2021.001001</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/apxhcak4lbftfkpthby76d4l7a">fatcat:apxhcak4lbftfkpthby76d4l7a</a>
</span>
more »
... constrained program under mild assumptions on the underlying optimization problem. The resulting conic reformulation of the original optimization problem can be directly solved by a commercial conic programming solver. We specialize our generic formulation to two classical optimization problems, namely, the Newsvendor Problem and the Uncapacitated Facility Location Problem. Our computational study in an out-of-sample analysis shows that the solutions obtained via the distributionally robust optimization approach yield significantly better performance in terms of the dispersion of the cost realizations while the central tendency deteriorates only slightly compared to the solutions obtained by stochastic programming.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210424042718/http://www.ijocta.org/index.php/files/article/download/1001/353" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/1c/71/1c71005c7e78b2ddd69a72fdb292a7fb7ef33948.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11121/ijocta.01.2021.001001">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
Publisher / doi.org
</button>
</a>