Set-valued minimax programming problems under generalized cone convexity

DOI10.1007/S12215-016-0258-6MaRDI QIDQ1696505zbMATH OpenOpenAlexFDO

Authors Chandal Nahak, Koushik Das

Publication date 14 February 2018

Published in Rendiconti del Circolo Matematico di Palermo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12215-016-0258-6

zbMATH Keywords

dualitycontingent epiderivativeconvex coneset-valued optimizationsufficient KKT optimality conditions

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Set-valued and variational analysis (49J53) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15)

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

• 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?)
• 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
• 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

(13)

• Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems
• On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
• Optimality conditions for set-valued minimax fractional programming problems
• Set-valued optimization problems under cone convexity
• scientific article; zbMATH DE number 5488843 (Why is no real title available?)
• On Generalized Gradients in Optimization Problems with Set-Valued Constraints
• scientific article; zbMATH DE number 7731187 (Why is no real title available?)
• PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
• Set-valued optimization problems via second-order contingent epiderivative
• Optimization problems with difference of set-valued maps under generalized cone convexity
• 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

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)