Stochastic Multiobjective Optimization: Sample Average Approximation and Applications

We investigate one stage stochastic multiobjective optimization problems where the objectives are the expected values of random functions. Assuming that the closed form of the expected values is difficult to obtain, we apply the well known Sample Average Approximation (SAA) method to solve it. We pr...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of optimization theory and applications Ročník 151; číslo 1; s. 135 - 162
Hlavní autori: Fliege, Jörg, Xu, Huifu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.10.2011
Springer
Springer Nature B.V
Predmet:
Applications of Mathematics
Applied sciences
Approximation
Calculus of Variations and Optimal Control; Optimization
Decision theory. Utility theory
Engineering
Exact sciences and technology
Expected values
Mathematical programming
Mathematics
Mathematics and Statistics
Numerical analysis
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Optimization
Random variables
Studies
Theory of Computation
Scalarization
Exponential convergence
Stochastic multiobjective programming
Efficient solution
Sample average approximation
Probabilistic approach
Sample size
Multiobjective programming
Modeling
Stochastic programming
Exact solution
Efficiency
Smoothing
Random function
ISSN:0022-3239, 1573-2878
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We investigate one stage stochastic multiobjective optimization problems where the objectives are the expected values of random functions. Assuming that the closed form of the expected values is difficult to obtain, we apply the well known Sample Average Approximation (SAA) method to solve it. We propose a smoothing infinity norm scalarization approach to solve the SAA problem and analyse the convergence of efficient solution of the SAA problem to the original problem as sample sizes increase. Under some moderate conditions, we show that, with probability approaching one exponentially fast with the increase of sample size, an ϵ -optimal solution to the SAA problem becomes an ϵ -optimal solution to its true counterpart. Moreover, under second order growth conditions, we show that an efficient point of the smoothed problem approximates an efficient solution of the true problem at a linear rate. Finally, we describe some numerical experiments on some stochastic multiobjective optimization problems and report preliminary results.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-011-9859-6