<p>The main focus of the paper is on a class of semi-infinite fractional interval-valued mathematical programming problems with vanishing constraints under data locally Lipschitzian ((NSIMPVC) for short). The definitions of Mordukhovich-convexity and a new version of the Abadie constraint qualifications are employed. Besides, two dual models of the Wolfe and Mond-Weir types for (NSIMPVC) are constructed through Mordukhovich subdifferentials. In addition, we derive the characterization of optimality and duality for (NSIMPVC) and its Wolfe and Mond-Weir types dual model in which three weak, strong, and converse duality relations for the same are examined. We also provide the VC-KKT-type necessary optimality conditions for (weakly) LU-optimal solution of (NSIMPVC) using the definition of the (ACQ) and (VC-ACQ) types Abadie constraint qualification along with the closedness of an aggregate set at the given vector. First-order necessary optimality condition becomes sufficient optimality condition under suitable assumptions on the generalized convexity of objective and constraint functions.</p>

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

Characterization of Optimality and Duality for Semi-Infinite Fractional Interval-Valued Mathematical Programs with Vanishing Constraints

  • Tran Van Su,
  • Dinh Dieu Hang

摘要

The main focus of the paper is on a class of semi-infinite fractional interval-valued mathematical programming problems with vanishing constraints under data locally Lipschitzian ((NSIMPVC) for short). The definitions of Mordukhovich-convexity and a new version of the Abadie constraint qualifications are employed. Besides, two dual models of the Wolfe and Mond-Weir types for (NSIMPVC) are constructed through Mordukhovich subdifferentials. In addition, we derive the characterization of optimality and duality for (NSIMPVC) and its Wolfe and Mond-Weir types dual model in which three weak, strong, and converse duality relations for the same are examined. We also provide the VC-KKT-type necessary optimality conditions for (weakly) LU-optimal solution of (NSIMPVC) using the definition of the (ACQ) and (VC-ACQ) types Abadie constraint qualification along with the closedness of an aggregate set at the given vector. First-order necessary optimality condition becomes sufficient optimality condition under suitable assumptions on the generalized convexity of objective and constraint functions.