Set-valued fractional programming problems under generalized cone convexity

DOI10.1007/S12597-015-0222-9MaRDI QIDQ522365zbMATH OpenOpenAlexFDO

Authors Koushik Das, Chandal Nahak

Publication date 28 April 2017

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-015-0222-9

zbMATH Keywords

dualitycontingent epiderivativeconvex coneset-valued map

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)

Recommendations

• Set-valued minimax programming problems under generalized cone convexity
• Optimality conditions and duality of the set-valued fractional programming problem
• Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
• Set-valued minimax fractional programming problems under \(p\)-cone arcwise connectedness
• Optimality conditions for set-valued minimax fractional programming problems

Cites work

• scientific article; zbMATH DE number 3760850 (Why is no real title available?)
• A note on nonlinear fractional vector maximization
• Contingent epiderivatives and set-valued optimization
• Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity
• Duality in multiple objective fractional programming problems involving non-convex functions
• Fractional programming involving set-valued functions
• Lagrangian duality for preinvex set-valued functions
• Multiobjective fractional programming involving \(\rho\)-invex and related functions
• Multivalued convexity and optimization: A unified approach to inequality and equality constraints
• Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
• Optimality and duality for multiobjective fractional problems with \(r\)-invexity
• Set-valued analysis
• Strong and Weak Convexity of Sets and Functions

Cited in

(16)

• Set-valued minimax programming problems under generalized cone convexity
• Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems
• On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
• scientific article; zbMATH DE number 7450966 (Why is no real title available?)
• Optimality conditions for set-valued minimax fractional programming problems
• Set-valued optimization problems under cone convexity
• Characterization of certain fractional-type set-valued functions
• Optimality conditions and duality of the set-valued fractional programming problem
• scientific article; zbMATH DE number 7731187 (Why is no real title available?)
• PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
• Necessary optimality conditions for a set valued fractional programming problem in terms of contingent epiderivatives
• 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
• Cone arcwise connectivity in optimization problems with difference of set-valued mappings
• Set-valued minimax fractional programming problems under \(p\)-cone arcwise connectedness

This page was built for publication: Set-valued fractional 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 Q522365)