Back to Search
Start Over
Set-valued minimax programming problems under generalized cone convexity.
- Source :
- Rendiconti del Circolo Matematico di Palermo (Series 2); Dec2017, Vol. 66 Issue 3, p361-374, 14p
- Publication Year :
- 2017
-
Abstract
- In this paper, a set-valued minimax programming problem (MP) is considered. The Karush-Kuhn-Tucker (KKT) sufficient optimality conditions are established for the problem (MP) via contingent epiderivative under generalized cone convexity assumptions. Mond-Weir ( MWD), Wolfe ( WD) and mixed ( MD) types duality are constructed for the problem (MP) and desired duality theorems between them are established. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0009725X
- Volume :
- 66
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Rendiconti del Circolo Matematico di Palermo (Series 2)
- Publication Type :
- Academic Journal
- Accession number :
- 126322193
- Full Text :
- https://doi.org/10.1007/s12215-016-0258-6