Thin and heavy tails in stochastic programming


summary:Optimization problems depending on a probability measure correspond to many applications. These problems can be static (single-stage), dynamic with finite (multi-stage) or infinite horizon, single- or multi-objective. It is necessary to have complete knowledge of the “underlying” probability measure if we are to solve the above-mentioned problems with precision. However this assumption is very rarely fulfilled (in applications) and consequently, problems have to be solved mostly on the basis of data. Stochastic estimates of an optimal value and an optimal solution can only be obtained using this approach. Properties of these estimates have been investigated many times. In this paper we intend to study one-stage problems under unusual (corresponding to reality, however) assumptions. In particular, we try to compare the achieved results under the assumptions of thin and heavy tails in the case of problems with linear and nonlinear dependence on the probability measure, problems with probability and risk measure constraints, and the case of stochastic dominance constraints. Heavy-tailed distributions quite often appear in financial problems [26] while nonlinear dependence frequently appears in problems with risk measures [22, 30]. The results we introduce follow mostly from the stability results based on the Wasserstein metric with the ``underlying" $ {\cal L}_{1}$ norm. Theoretical results are completed by a simulation investigation

Similar works

Full text


Institute of Mathematics AS CR, v. v. i.

Provided a free PDF
oai:oai.dml.cz:10338.dmlcz/144379Last time updated on 7/9/2019View original full text link

This paper was published in Institute of Mathematics AS CR, v. v. i..

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.