minimax programming
Recently Published Documents


TOTAL DOCUMENTS

50
(FIVE YEARS 3)

H-INDEX

9
(FIVE YEARS 0)

Author(s):  
Tadeusz Antczak ◽  
Najeeb Abdulaleem
Keyword(s):  


Author(s):  
Vivek Laha ◽  
Rahul Kumar ◽  
Harsh Narayan Singh ◽  
S. K. Mishra


2020 ◽  
Vol 147 ◽  
pp. 106644
Author(s):  
Xiaobin Yang ◽  
Jianjun Qiu ◽  
Huimei Guo ◽  
Xiaopeng Yang




Optimization ◽  
2017 ◽  
Vol 66 (11) ◽  
pp. 1755-1776
Author(s):  
Truong Q. Bao ◽  
Pankaj Gupta ◽  
Phan Q. Khanh


Filomat ◽  
2017 ◽  
Vol 31 (14) ◽  
pp. 4555-4570 ◽  
Author(s):  
I. Ahmad ◽  
Krishna Kummari ◽  
Vivek Singh ◽  
Anurag Jayswal

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.



Sign in / Sign up

Export Citation Format

Share Document