Convexifactors, generalized convexity and vector optimization

Optimization ◽  
2004 ◽  
Vol 53 (1) ◽  
pp. 77-94 ◽  
Author(s):  
J. Dutta ◽  
S. Chandra
Keyword(s):  
Vector Optimization ◽  
Generalized Convexity

Generalized Convexity and Nonsmooth Problems of Vector Optimization

2005 ◽  
Vol 31 (3) ◽  
pp. 383-403 ◽  
Author(s):  
Pham Huu Sach ◽  
Do Sang Kim ◽  
Gue Myung Lee
Keyword(s):  
Vector Optimization ◽  
Generalized Convexity ◽  
Nonsmooth Problems

Generalized convexity in fuzzy vector optimization through a linear ordering

2015 ◽  
Vol 312 ◽  
pp. 13-24 ◽  
Author(s):  
M. Arana-Jiménez ◽  
A. Rufián-Lizana ◽  
Y. Chalco-Cano ◽  
H. Román-Flores
Keyword(s):  
Vector Optimization ◽  
Generalized Convexity ◽  
Linear Ordering ◽  
Fuzzy Vector

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.

Sign in / Sign up

Export Citation Format

Share Document