Set-valued fractional programming problems under generalized cone convexity
From MaRDI portal
Publication:522365
DOI10.1007/S12597-015-0222-9zbMATH Open1360.90243OpenAlexW1897317611MaRDI QIDQ522365FDOQ522365
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
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
Multi-objective and goal programming (90C29) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)
Cites Work
- Strong and Weak Convexity of Sets and Functions
- Set-valued analysis
- Contingent epiderivatives and set-valued optimization
- Lagrangian duality for preinvex set-valued functions
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Title not available (Why is that?)
- Multiobjective fractional programming involving \(\rho\)-invex and related functions
- Duality in multiple objective fractional programming problems involving non-convex functions
- Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity
- A note on nonlinear fractional vector maximization
- Fractional programming involving set-valued functions
- Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
- Optimality and duality for multiobjective fractional problems with \(r\)-invexity
Cited In (16)
- On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
- Title not available (Why is that?)
- PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
- Set-valued optimization problems via second-order contingent epiderivative
- Set-valued optimization problems under cone convexity
- 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 and duality of the set-valued fractional programming problem
- Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems
- Necessary optimality conditions for a set valued fractional programming problem in terms of contingent epiderivatives
- Title not available (Why is that?)
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Optimality conditions for set-valued minimax fractional programming problems
- Optimization problems with difference of set-valued maps under generalized cone convexity
- Set-valued minimax programming problems under generalized cone convexity
- Characterization of certain fractional-type set-valued functions
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)
