Set-valued minimax programming problems under generalized cone convexity
From MaRDI portal
Publication:1696505
DOI10.1007/s12215-016-0258-6zbMath1386.49021OpenAlexW2518833452MaRDI QIDQ1696505
Publication date: 14 February 2018
Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12215-016-0258-6
dualityconvex coneset-valued optimizationcontingent epiderivativesufficient KKT optimality conditions
Set-valued and variational analysis (49J53) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items (6)
Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY ⋮ On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness ⋮ Unnamed Item ⋮ Set-valued optimization problems via second-order contingent epiderivative ⋮ Optimality conditions for set-valued minimax fractional programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set-valued fractional programming problems under generalized cone convexity
- Existence and Lagrangian duality for maximization of set-valued functions
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Duality for a class of nondifferentiable mathematical programming problems
- Necessary conditions and sufficient conditions for static minmax problems
- Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
- Contingent epiderivatives and set-valued optimization
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
- The Theory of Max-Min, with Applications
- Set-valued analysis
This page was built for publication: Set-valued minimax programming problems under generalized cone convexity