Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity
From MaRDI portal
Publication:868552
DOI10.1007/s10957-006-9105-9zbMath1278.90362OpenAlexW2081409485MaRDI QIDQ868552
Publication date: 6 March 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9105-9
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)
Related Items (4)
Optimality and duality in vector optimization involving generalized type I functions over cones ⋮ On quasidifferentiable mathematical programs with equilibrium constraints ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
Cites Work
- Unnamed Item
- Strong convexity of sets and functions
- On efficiency and duality for multiobjective programs
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- Proper efficiency and the theory of vector maximization
- On sufficiency and duality for generalised quasicnvex nonsmooth programs
- Vector-valued lagrangian and multiobjective fractional programming duality
- Strong and Weak Convexity of Sets and Functions
- Optimization and nonsmooth analysis
- Further Generalizations of Convexity in Mathematical Programming
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
This page was built for publication: Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity
