Optimality conditions for set-valued minimax fractional programming problems

DOI10.1007/s40324-019-00209-7zbMath1446.90161OpenAlexW2982543602WikidataQ126860691 ScholiaQ126860691MaRDI QIDQ777468

Chandal Nahak, Koushik Das

Publication date: 7 July 2020

Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40324-019-00209-7

zbMATH Keywords

dualityconvex coneset-valued mapcontingent epiderivative

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (5)

PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY ⋮ On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness ⋮ Optimality and duality for \(E\)-minimax fractional programming: application to multiobjective optimization ⋮ Unnamed Item ⋮ Set-valued optimization problems via second-order contingent epiderivative

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set-valued fractional programming problems under generalized cone convexity
• On duality theorems for a nondifferentiable minimax fractional programming
• Existence and Lagrangian duality for maximization of set-valued functions
• On minimax fractional optimality conditions with \((F,\rho)\)-convexity
• Necessary and sufficient conditions for minimax fractional programming
• Contingent epiderivatives and set-valued optimization
• Set-valued minimax programming problems under generalized cone convexity
• Optimality conditions and duality for a minimax fractional programming with generalized convexity
• Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
• Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
• Duality for fractional minimax programming problems
• Multivalued convexity and optimization: A unified approach to inequality and equality constraints
• Set-valued analysis

This page was built for publication: Optimality conditions for set-valued minimax fractional programming problems