Open AccessOptimality and duality for nonsmooth minimax programming problems using convexifactor
Author(s) -
Ahmad Ismail,
Krishna Kummari,
Vivek Sing,
Anurag Jayswal
Publication year - 2017
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1714555a
Subject(s) - mathematics , minimax , duality (order theory) , convexity , mathematical optimization , lipschitz continuity , subderivative , strong duality , mathematical economics , optimization problem , convex optimization , regular polygon , pure mathematics , geometry , financial economics , economics
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.