Published in

Springer Verlag, Cybernetics and Systems Analysis, 5(50), p. 679-692

DOI: 10.1007/s10559-014-9658-9

Links

Tools

Export citation

Search in Google Scholar

Reducing Two-Stage Probabilistic Optimization Problems with Discrete Distribution of Random Data to Mixed-Integer Programming Problems*

Journal article published in 2014 by Vladimir I. Norkin, Andrey I. Kibzun, Andrey V. Naumov
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

We consider two-stage stochastic programming models with quantile criterion as well as models with a probabilistic constraint on the random values of the objective function of the second stage. These models allow us to formalize the requirements for the reliability and safety of the system being optimized and to optimize system’s performance under extreme conditions. We propose a method of equivalent transformation of these models under discrete distribution of random parameters to mixed-integer programming problems. The number of additional integer (Boolean) variables in these problems equals to the number of possible values of the vector of random parameters. The obtained mixed optimization problems can be solved by powerful standard discrete optimization software. To illustrate the approach, the results of numerical experiment for the problem of small dimension are presented.