Browse > Article
http://dx.doi.org/10.14403/jcms.2013.26.4.723

ON DUALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS  

Lee, Gue Myung (Department of Applied Mathematics Pukyong National University)
Kim, Moon Hee (School of Free Major Tongmyong University)
Publication Information
Journal of the Chungcheong Mathematical Society / v.26, no.4, 2013 , pp. 723-734 More about this Journal
Abstract
A robust optimization problem, which has a maximum function of continuously differentiable functions as its objective function, continuously differentiable functions as its constraint functions and a geometric constraint, is considered. We prove a necessary optimality theorem and a sufficient optimality theorem for the robust optimization problem. We formulate a Wolfe type dual problem for the robust optimization problem, which has a differentiable Lagrangean function, and establish the weak duality theorem and the strong duality theorem which hold between the robust optimization problem and its Wolfe type dual problem. Moreover, saddle point theorems for the robust optimization problem are given under convexity assumptions.
Keywords
robust optimization problems; uncertain parameters; optimality theorems; Wolfe type dual problem; duality theorems; saddle-point theorems;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 D. Bertsimas and D. Brown, Constructing uncertainty sets for robust linear optimization, Oper. Res. 57 (2009), 1483-1495.   DOI   ScienceOn
2 A. Ben-Tal and A. Nemirovski, Robust optimization-methodology and applications, Math. Program. Ser. B 92 (2002), 453-480.   DOI
3 A. Ben-Tal and A. Nemirovski, A selected topics in robust convex optimization, Math. Program. Ser. B 112 (2008), 125-158.
4 D. Bertsimas, D. Pachamanova, and M. Sim, Robust linear optimizaion under general norms, Oper. Res. Lett. 32 (2004), 510-516.   DOI   ScienceOn
5 A. Ben-Tal, L. E. Ghaoui, and A. Nemirovski, Robust optimization, Princeton Series in Applied Mathematics, 2009.
6 V. Jeyakumar, G. Li, and G. M. Lee, A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty, Oper. Res. Lett. 39 (2011), 109-114.   DOI   ScienceOn
7 V. Jeyakumar, G. Li, and G. M. Lee, Robust duality for generalized convex programming problems under data uncertainty, Nonlinear Analysis 75 (2012), 1362-1373.   DOI   ScienceOn
8 M. H. Kim, Robust duality for generalized invex programming problems, Commun. Korean Math. Soc. 28 (2013), 419-423.   과학기술학회마을   DOI   ScienceOn
9 D. Kuroiwa and G. M. Lee, On robust multiobjective optimization, Vietnam J. Math. 40 (2012), 305-317.
10 O. L. Mangasarian, Nonlinear Programming, SIAM, Philadelphia, 1994.
11 R. T. Rockafellar, Convex Analysis, Princeton Univ. Press, Princeton, N. J., 1970.
12 A. Shapiro, D. Dentcheva, and A. Ruszczynski, Lectures on Stochastic Programming: Modeling and Theory, SIAM, Philadelphia, 2009.