minimax programming
Recently Published Documents

TOTAL DOCUMENTS

50
(FIVE YEARS 3)

H-INDEX

9
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

E-differentiable minimax programming under E-convexity

2021 ◽  
Author(s):  
Tadeusz Antczak ◽  
Najeeb Abdulaleem
Keyword(s):  
Minimax Programming

On Minimax Programming with Vanishing Constraints

2021 ◽  
pp. 247-263
Author(s):  
Vivek Laha ◽  
Rahul Kumar ◽  
Harsh Narayan Singh ◽  
S. K. Mishra
Keyword(s):  
Minimax Programming ◽  
Vanishing Constraints

Fuzzy relation weighted minimax programming with addition-min composition

2020 ◽  
Vol 147 ◽  
pp. 106644
Author(s):  
Xiaobin Yang ◽  
Jianjun Qiu ◽  
Huimei Guo ◽  
Xiaopeng Yang
Keyword(s):  
Fuzzy Relation ◽  
Minimax Programming

Weighted minimax programming subject to the two-sides fuzzy relation inequalities with max-product composition

2020 ◽  
Vol 39 (1) ◽  
pp. 593-605
Author(s):  
Guanrong Li ◽  
Jianjun Qiu ◽  
Xiaopeng Yang
Keyword(s):  
Fuzzy Relation ◽  
Minimax Programming ◽  
Product Composition ◽  
Two Sides

Necessary optimality conditions for minimax programming problems with mathematical constraints

Optimization ◽  
2017 ◽  
Vol 66 (11) ◽  
pp. 1755-1776
Author(s):  
Truong Q. Bao ◽  
Pankaj Gupta ◽  
Phan Q. Khanh
Keyword(s):  
Optimality Conditions ◽  
Necessary Optimality Conditions ◽  
Minimax Programming

scholarly journals Optimality and duality for nonsmooth minimax programming problems using convexifactor

Filomat ◽  
2017 ◽  
Vol 31 (14) ◽  
pp. 4555-4570 ◽  
Author(s):  
I. Ahmad ◽  
Krishna Kummari ◽  
Vivek Singh ◽  
Anurag Jayswal
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Vector Optimization ◽  
Duality Theory ◽  
Generalized Convexity ◽  
Clarke Subdifferential ◽  
Locally Lipschitz Functions ◽  
Minimax Programming ◽  
Locally Lipschitz ◽  
Optimality And Duality

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.

Load More ...
Sign in / Sign up

Export Citation Format

Share Document