Set-valued minimax programming problems under generalized cone convexity
From MaRDI portal
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.
Recommendations
- Optimality conditions for set-valued minimax fractional programming problems
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Set-valued fractional programming problems under generalized cone convexity
- Set-valued minimax fractional programming problems under p-cone arcwise connectedness
- Set-valued optimization problems under cone convexity
Cites work
- Contingent epiderivatives and set-valued optimization
- Duality for a class of nondifferentiable mathematical programming problems
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Existence and Lagrangian duality for maximization of set-valued functions
- scientific article; zbMATH DE number 3918106 (Why is no real title available?)
- scientific article; zbMATH DE number 3760850 (Why is no real title available?)
- scientific article; zbMATH DE number 798857 (Why is no real title available?)
- scientific article; zbMATH DE number 279301 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Necessary conditions and sufficient conditions for static minmax problems
- Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
- Set-valued analysis
- Set-valued fractional programming problems under generalized cone convexity
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
- The Theory of Max-Min, with Applications
Cited in
(15)- Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Set-valued optimization problems via second-order contingent epiderivative
- Set-valued optimization problems under cone convexity
- Set-valued minimax fractional programming problems under p-cone arcwise connectedness
- Set-valued fractional programming problems under generalized cone convexity
- Optimization problems with difference of set-valued maps under generalized cone convexity
- scientific article; zbMATH DE number 5488843 (Why is no real title available?)
- On Generalized Gradients in Optimization Problems with Set-Valued Constraints
- PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
- On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
- scientific article; zbMATH DE number 7731187 (Why is no real title available?)
- Set-valued minimax fractional programming problems with higher-order -cone arcwise connectedness
- Set-valued minimax programming problems under higher-order -arcwisely connectivity
- Optimality conditions for set-valued minimax fractional programming problems
This page was built for publication: Set-valued minimax programming problems under generalized cone convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696505)
