본문 바로가기
KERD
논문KCI 등재

Duality theorem and vector saddle point theorem for robust multiobjective optimization problems

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, Mond-Weir type duality results for a uncertain multiobjective robust optimization problem are given under generalized invexity assumptions. Also, weak vector saddle-point theorems are obtained under convexity assumptions.

Abstract

In this paper, Mond-Weir type duality results for a uncertain multiobjective robust optimization problem are given under generalized invexity assumptions. Also, weak vector saddle-point theorems are obtained under convexity assumptions.

참고문헌 (9)

  1. A. Ben-Tal, "Robust Optimization", Princeton Series in Applied Mathematics (2009)
  2. A. Ben-Tal, "Robust-optimization-methodology and applications", Math. Program. Ser B, 92(3), pp.453~480 (2002)
  3. A. Ben-Tal, "Selected topics in robust convex optimization", Math. Program. Ser B, 112(1), pp.125~158 (2008)
  4. D. Bertsimas, "Constructing uncertainty sets for robust linear optimization", Oper. Res, 57(6), pp.1483~1495 (2009)
  5. D. Bertsimas, "Robust linear optimization under general norms", Oper. Res. Lett, 32(6), pp.510~516 (2004)
  6. V. Jeyakumar, G. Li, "A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty", Oper. Res. Lett, 39(2), pp.109~114 (2011)
  7. V. Jeyakumar, "Robust duality for generalized convex programming problems under data uncer- tainty", Nonlinear Anal, 75(3), pp.1362~1373 (2012)
  8. M. H. Kim, "Robust duality for generalized invex programming problems", ~
  9. D. Kuroiwa, "On robust multiobjective optimization", ~

관련 논문AI추천

이 간행물의 다른 논문 (19건)