Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications

In this article, we employ advanced techniques of convex analysis and $ \mathcal {C} $ C -differentiation to examine KKT-type robust necessary and sufficient optimality conditions and robust duality for an uncertain multiobjective programming problem under uncertainty sets, where $ \mathcal {C} $ C...

Full description

Bibliographic Details

Published in:	Optimization Vol. 73; no. 3; pp. 641 - 672
Main Authors:	Nguyen, Thuy Thi Thu, Su, Tran Van, Linh, Dang Hong
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 03.03.2024 Taylor & Francis LLC
Subjects:	Convex analysis Convexity Derivatives duality theorems KKT-type robust optimality conditions mathcal {C} Mathematical programming Multiobjective programming problem with uncertain data Multiple objective analysis Robustness (mathematics) Uncertainty uncertainty sets
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!