Sample average approximation of stochastic dominance constrained programs (Q431031)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6050457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sample average approximation of stochastic dominance constrained programs |
scientific article; zbMATH DE number 6050457 |
Statements
Sample average approximation of stochastic dominance constrained programs (English)
0 references
26 June 2012
0 references
The paper develops an algorithm for the solution of optimization problems with multi-variate second-order stochastic dominance constraints. The sample Average Approximation (SAA) method is applied to a relaxation of this problem. For the resulting semi-infinite program, asymptotic convergence of optimal values and optimal solutions (as the sample size goes to infinity) is studied, under suitable structural and distributional assumptions. Additional convexity assumptions are exploited to develop a finitely convergent method that provides an \(\varrho\)-optimal solution of the solved SAA problem. Finally, statistical lower and upper bounds for the optimal value of the relaxed true problem are suggested.
0 references
stochastic programming
0 references
multivariate stochastic dominance
0 references
sample average approximation
0 references
cutting plane algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.876855731010437
0 references
0.8644512891769409
0 references
0.8565125465393066
0 references
0.8560376167297363
0 references
0.8495520353317261
0 references
