Sufficiency and duality in nondifferentiable multiobjective programming involving generalized type I functions
From MaRDI portal
Publication:2488799
DOI10.1016/j.jmaa.2005.02.064zbMath1111.90099OpenAlexW2035333056MaRDI QIDQ2488799
Mohamed Hachimi, Brahim Aghezzaf
Publication date: 16 May 2006
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.02.064
DualityGeneralized convexitySufficiencyEfficient solutionNondifferentiable multiobjective programming problemType I functions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Nonsmooth multiple-objective optimization in separable Hilbert spaces ⋮ Nonsmooth multiobjective optimization using limiting subdifferentials ⋮ Optimality for \((h,\varphi)\)-multiobjective programming involving generalized type-I functions ⋮ Some vector optimization problems in Banach spaces with generalized convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality criteria in nonlinear programming involving nonconvex functions
- Theory of multiobjective optimization
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Efficiency and generalized convex duality for multiobjective programs
- Nonlinear multiobjective optimization
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Optimality and duality with generalized convexity
- Mixed type duality in multiobjective programming problems
- Strong and Weak Convexity of Sets and Functions
- Necessary and sufficient conditions in constrained optimization
- Further Generalizations of Convexity in Mathematical Programming
- Generalized invexity and duality in multiobjective programming problems
- Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
- On mixed duality in mathematical programming.
- Optimality conditions and duality for a class of nonlinear fractional programming problems.