General Properties of Two-Stage Stochastic Programming Problems with Probabilistic Criteria

被引：0
作者：
S. V. Ivanov
A. I. Kibzun
机构：
[1] Moscow Aviation Institute (National Research University),
来源：
Automation and Remote Control | 2019年 / 80卷
关键词：
stochastic programming; two-stage problem; probabilistic criterion; quantile criterion;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Two-stage stochastic programming problems with the probabilistic and quantile criteria in the general statement are considered. Sufficient conditions for the measurability of the loss function and also for the semicontinuity of the criterion functions are given. Sufficient conditions for the existence of optimal strategies are established. The equivalence of the a priori and a posteriori statements of the problems under study is proved. The application of the confidence method, which consists in the transition to a deterministic minimax problem, is described and justified. Sample approximations of the problems are constructed and also conditions under which the optimal strategies in the approximating problems converge to the optimal strategy in the original problem are presented. The results are illustrated by an example of the linear two-step problem. The two-stage problem with the probabilistic criterion is reduced to a mixed-integer problem.
引用
收藏
页码：1041 / 1057
页数：16
相关论文
共 38 条
[1]  
Wets RJ-B(1974)Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program SIAM Rev. 16 309-339
[2]  
Kulkarni AA(2012)Recourse-Based Stochastic Nonlinear Programming: Properties and Benders-SQP Algorithms Comput. Optim. Appl. 51 77-123
[3]  
Shanbhag UV(1995)A Two-Stage Quantile Linear Programming Problem Autom. Remote Control 56 68-76
[4]  
Kibzun AI(2006)Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse Math. Program., Ser. B 105 365-386
[5]  
Naumov AV(2014)Reducing Two-Stage Probabilistic Optimization Problems with Discrete Distribution of Random Data to Mixed-Integer Programming Problems Cybernet. Syst. Anal. 50 679-692
[6]  
Schultz R(1992)Relaxation for Probabilistically Constrained Programs with Discrete Random Variables Oper. Res. Lett. 11 81-86
[7]  
Tiedemann S(2002)Probabilistic Programming with Discrete Distributions and Precedence Constrained Knapsack Polyhedra Math. Program. 93 195-215
[8]  
Norkin VI(2010)An Interger Programming Approach for Linear Programs with Probabilistic Constraints Math. Program. 122 247-272
[9]  
Kibzun AI(2010)MIP Reformulations of the Probabilistic Set Covering Problem Math. Program. 121 1-31
[10]  
Naumov AV(2006)Solution to a Two-step Logistics Problem in a Quantile Statement Autom. Remote Control 67 1893-1899
1234