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

ON SUFFICIENCY AND DUALITY FOR ROBUST OPTIMIZATION PROBLEMS INVOLVING (V, ρ)-INVEX FUNCTIONS

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we formulate a sucient optimality theorem for the robust optimization problem (UP) under (V, ρ)-invexity assumption. Moreover, we formulate a Mond-Weir type dual problem for the robust optimization problem (UP) and show that the weak and strong duality hold between the primal problems and the dual problems.

Abstract

In this paper, we formulate a sucient optimality theorem for the robust optimization problem (UP) under (V, ρ)-invexity assumption. Moreover, we formulate a Mond-Weir type dual problem for the robust optimization problem (UP) and show that the weak and strong duality hold between the primal problems and the dual problems.

참고문헌 (8)

  1. D. Bertsimas, "Constructing uncertainty sets for robust linear optimization", Oper. Res, 57, pp.1483~1495 (2009)
  2. A. Ben-Tal, "Robust-optimization-methodology and applications", Math. Program., Ser B, 92, pp.453~480 (2002)
  3. A. Ben-Tal, "A selected topics in robust convex optimization", Math. Program., Ser B, 112, pp.125~158 (2008)
  4. D. Bertsimas, "Robust linear optimization under general norms", Oper. Res. Lett, 32, pp.510~516 (2004)
  5. A. Ben-Tal, "A. Nemirovski, Robust optimization" (2009), Princeton Series in Ap-plied Mathematics
  6. V. Jeyakumar, "A robust von Neumann minimax theorem for zero-sum games under bounded payo® uncertainty", Oper. Res. Lett, 39, pp.109~114 (2011)
  7. H. Kuk, "Nonsmooth multiobjective programs with (V, ρ)-invexity", Indian Journal of Pure and Applied Mathematics, 29, pp.405~412 (1998)
  8. 이규명, "On duality theorems for robust optimization problems", 충청수학회지, 26(4), pp.723~734 (2013), 충청수학회[DOI]

관련 논문AI추천

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