Set-valued minimax programming problems under generalized cone convexity (Q1696505)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Set-valued minimax programming problems under generalized cone convexity |
scientific article; zbMATH DE number 6838825
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set-valued minimax programming problems under generalized cone convexity |
scientific article; zbMATH DE number 6838825 |
Statements
Set-valued minimax programming problems under generalized cone convexity (English)
0 references
14 February 2018
0 references
The authors formulate KKT sufficient optimality conditions in terms of contingent epiderivatives for a set-valued constrained minimax optimization problem. The KKT system is the starting point for the formulation of a Mond-Weir, a Wolfe and a so-called mixed type dual problem. For each primal-dual pair weak, strong and converse duality theorems are provided.
0 references
set-valued optimization
0 references
sufficient KKT optimality conditions
0 references
contingent epiderivative
0 references
duality
0 references
convex cone
0 references
0 references
0 references
0 references
