Commun. Korean Math. Soc. 2013; 28(2): 419-423
Printed April 1, 2013
https://doi.org/10.4134/CKMS.2013.28.2.419
Copyright © The Korean Mathematical Society.
Moon Hee Kim
Tongmyong University
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.
Keywords: robust multiobjective optimization, robust weakly efficient solution, necessary optimality theorem, Wolfe type robust duality
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd