본문 바로가기

REPRESENTATION OF THE NORMAL CONE AND ITS APPLICATIONS IN ROBUST MINIMAX PROGRAMMING PROBLEMS

Representation of the normal cone and its applications in robust minimax programmins

문서 유형
연구출판물 · 학술지 논문
등재
SCIEScopus
저널 순위
JCR Q3Scopus Q3
저널
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS20(12) · pp.2495 · 2019
피인용
Web of Science 6Scopus 5
FWCI (Scopus)
0.16
JCR IF
JCR 2018 0.595
ISSN
1345-4773

저자

  1. 교립국제1저자부산대학교, 센터, 빅데이터기반금융.수산.제조 혁신산업수학센터, KO
  2. 김현민부산대학교, 자연과학대학, 수학과, KO
  3. 맹걸부산대학교, 자연과학대학, 수학과, KO
  4. Kim, Do Sang교신저자부경대학교, Dept Appl Math, KO

초록

In this paper, we focus on the study of optimality conditions and duality in robust minimax programming problems in the face of data uncertainty. Following robust optimization approach (worst-case approach), we formulate its robust counterpart of the minimax programming problems under data uncertainty. A representation of the normal cone to a convex set is established under the robust characteristic cone constraint qualification. Then, by using the obtained result, we propose the necessary condition for optimal solutions of the considered problem; moreover, a dual problem in term of Wolfe type to the primal one is stated, and weak and strong duality relations between them are explored. Finally, some of these results are applied to a robust multiobjective optimization problem, and to the behaviour of the so-called quasi epsilon-solution to the robust minimax programming problems.

키워드

Robust minimax programming problemsrobust characteristic cone constraint qualificationoptimality conditionsduality theoremsOPTIMALITY CONDITIONSDUALITY

식별자

Scopus EID
2-s2.0-85090910504
WoS UID
000510423700004