Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
From MaRDI portal
Publication:2392768
DOI10.1007/s10898-012-9849-8zbMath1300.90042MaRDI QIDQ2392768
A. Jawhar, Nazih Abderrazzak Gadhi
Publication date: 2 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9849-8
optimality conditions; set-valued optimization; fractional optimization; local weak efficient solution
90C29: Multi-objective and goal programming
90C32: Fractional programming
49K99: Optimality conditions
Related Items
Set-valued fractional programming problems under generalized cone convexity, Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
Cites Work
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Some properties of the bilevel programming problem
- Pareto optimality, game theory and equilibria
- Necessary optimality conditions for bilevel set optimization problems
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
- On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Second order optimality conditions for the extremal problem under inclusion constraints
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Kolmogorov conditions for vectorial optimization problems
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Necessary optimality conditions for bilevel optimization problems using convexificators
- On Subdifferentials of Optimal Value Functions
- A formula on the approximate subdifferential of the difference of convex functions
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Nonsmooth sequential analysis in Asplund spaces
- Optimality conditions for maximizations of set-valued functions
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
