Optimality conditions for set-valued minimax fractional programming problems
From MaRDI portal
Recommendations
- Set-valued minimax fractional programming problems under \(p\)-cone arcwise connectedness
- Set-valued minimax programming problems under generalized cone convexity
- scientific article; zbMATH DE number 6001420
- Set-valued fractional programming problems under generalized cone convexity
- Necessary and sufficient conditions for minimax fractional programming
Cites work
- scientific article; zbMATH DE number 3918106 (Why is no real title available?)
- scientific article; zbMATH DE number 4055404 (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 222438 (Why is no real title available?)
- Contingent epiderivatives and set-valued optimization
- Duality for fractional minimax programming problems
- Existence and Lagrangian duality for maximization of set-valued functions
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Necessary and sufficient conditions for minimax fractional programming
- On duality theorems for a nondifferentiable minimax fractional programming
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Optimality conditions and duality for a minimax fractional programming with generalized convexity
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
- Set-valued analysis
- Set-valued fractional programming problems under generalized cone convexity
- Set-valued minimax programming problems under generalized cone convexity
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
Cited in
(13)- Set-valued minimax programming problems under generalized cone convexity
- Optimality conditions for fractional minmax programming
- On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
- Optimality conditions and duality of the set-valued fractional programming problem
- Optimality and duality for \(E\)-minimax fractional programming: application to multiobjective optimization
- scientific article; zbMATH DE number 7731187 (Why is no real title available?)
- Optimality conditions for a d.c. set-valued problem via the extremal principle
- PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
- Set-valued optimization problems via second-order contingent epiderivative
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Set-valued fractional programming problems under generalized cone convexity
- Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
- Set-valued minimax fractional programming problems under \(p\)-cone arcwise connectedness
This page was built for publication: Optimality conditions for set-valued minimax fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777468)