Robust duality for generalized invex programming problems
0
조회
0
다운로드
6
인용
0
참고문헌
키워드
초록
In this paper we present a robust duality theory for generalized convex programming problems under data uncertainty. Recently, Jeyakumar, Li and Lee [Nonlinear Analysis 75 (2012), no. 3, 1362--1373] established a robust duality theory for generalized convex programming problems in the face of data uncertainty. Furthermore, we extend results of Jeyakumar, Li and Lee for an uncertain multiobjective robust optimization problem.
Abstract
In this paper we present a robust duality theory for generalized convex programming problems under data uncertainty. Recently, Jeyakumar, Li and Lee [Nonlinear Analysis 75 (2012), no. 3, 1362--1373] established a robust duality theory for generalized convex programming problems in the face of data uncertainty. Furthermore, we extend results of Jeyakumar, Li and Lee for an uncertain multiobjective robust optimization problem.
참고문헌 (8)
- A. Ben-Tal, "Robust Optimization", Princeton Series in Applied Mathematics (2009)
- A. Ben-Tal, "Robust-optimization-methodology and applications", Math. Program. Ser B, 92(3), pp.453~480 (2002)
- A. Ben-Tal, "Selected topics in robust convex optimization", Math. Program. Ser B, 112(1), pp.125~158 (2008)
- D. Bertsimas, "Constructing uncertainty sets for robust linear optimization", Oper. Res, 57(6), pp.1483~1495 (2009)
- D. Bertsimas, "Robust linear optimization under general norms", Oper. Res. Lett, 32(6), pp.510~516 (2004)
- V. Jeyakumar, "A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty", Oper. Res. Lett, 39(2), pp.109~114 (2011)
- V. Jeyakumar, "Robust duality for generalized convex programming problems under data uncer- tainty", Nonlinear Anal, 75(3), pp.1362~1373 (2012)
- D. Kuroiwa, "On robust multiobjective optimization", ~