Optimality and Duality for Nonsmooth Minimax Programming Problems Using Convexifactor

被引：8

作者：

Ahmad, I. ^{[1
]}

Kummari, Krishna ^{[2
]}

Singh, Vivek ^{[3
]}

Jayswal, Anurag ^{[3
]}

机构：

[1] King Fahd Univ Petr & Minerals, Dept Math & Stat, Dhahran 31261, Saudi Arabia

[2] KIIT Univ, Sch Appl Sci, Dept Math, Bhubaneswar 751024, Odisha, India

[3] Indian Inst Technol, Indian Sch Mines, Dept Appl Math, Dhanbad 826004, Jharkhand, India

来源：

FILOMAT | 2017年 / 31卷 / 14期

关键词：

Nonsmooth minimax programming; directional Dini-derivatives; convexifactor; optimality conditions; sufficiency; duality; GENERALIZED CONVEXITY; SUFFICIENT CONDITIONS; OPTIMIZATION; CONVEXIFICATORS;

D O I：

10.2298/FIL1714555A

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The aim of this work is to study optimality conditions for nonsmooth minimax programming problems involving locally Lipschitz functions by means of the idea of convexifactors that has been used in [J. Dutta, S. Chandra, Convexifactors, generalized convexity and vector optimization, Optimization, 53 (2004) 77-94]. Further, using the concept of optimality conditions, Mond-Weir and Wolfe type duality theory has been developed for such a minimax programming problem. The results in this paper extend the corresponding results obtained using the generalized Clarke subdifferential in the literature.

引用

页码：4555 / 4570

页数：16

共 25 条

[1] Duality in nondifferentiable minimax fractional programming with generalized convexity [J].