<p>This article investigates robust optimality and duality for a class of nonsmooth semidefinite multiobjective programming problems with uncertain data (in short, UNSMP) via convexificators. Using the properties of convexificators, we deduce Fritz John (in short, FJ)-type and Karush–Kuhn–Tucker (in short, KKT)-type necessary optimality conditions for UNSMP. Moreover, under generalized convexity assumptions, we establish sufficient optimality criteria for UNSMP. Furthermore, we present the Wolfe-type (in short, WRD) and Mond–Weir-type (in short, MWRD) robust dual models corresponding to the primal problem UNSMP. Several illustrative non-trivial examples are furnished to demonstrate the significance of the established results.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimality and Duality for Robust Nonsmooth Semidefinite Multiobjective Programming Problems Using Convexificators

  • Balendu Bhooshan Upadhyay,
  • Shubham Kumar Singh,
  • Ioan Stancu-Minasian

摘要

This article investigates robust optimality and duality for a class of nonsmooth semidefinite multiobjective programming problems with uncertain data (in short, UNSMP) via convexificators. Using the properties of convexificators, we deduce Fritz John (in short, FJ)-type and Karush–Kuhn–Tucker (in short, KKT)-type necessary optimality conditions for UNSMP. Moreover, under generalized convexity assumptions, we establish sufficient optimality criteria for UNSMP. Furthermore, we present the Wolfe-type (in short, WRD) and Mond–Weir-type (in short, MWRD) robust dual models corresponding to the primal problem UNSMP. Several illustrative non-trivial examples are furnished to demonstrate the significance of the established results.