Necessary and sufficient optimality conditions for fractional multi-objective problems
From MaRDI portal
Publication:3514832
DOI10.1080/02331930701455945zbMath1176.90537OpenAlexW2055848285MaRDI QIDQ3514832
Publication date: 23 July 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701455945
multi-objective optimizationoptimality conditionsscalarizationpseudoinvexityPareto minimumconvexificator
Related Items (9)
Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Duality for multiobjective fractional programming problem using convexifactors ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ Optimality and duality for multi-objective fractional programming in complex spaces ⋮ Unnamed Item ⋮ Optimality criteria for fuzzy-valued fractional multi-objective optimization problem ⋮ Fuzzy Optimality Conditions for Fractional Multiobjective Bilevel Problems Under Fractional Constraints ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Fuzzy optimality conditions for fractional multi-objective problems
Cites Work
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Maximal vectors and multi-objective optimization
- Pareto optimality in multiobjective problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- On the regularity condition for vector programming problems
- On the mean value theorem
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Second order approximations and dual necessary optimality conditions
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Small convex-valued subdifferentials in mathematical programming
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- On duality theorems for nonsmooth Lipschitz optimization problems
This page was built for publication: Necessary and sufficient optimality conditions for fractional multi-objective problems
