Multiobjective Problems with Nonsmooth Equality Constraints
From MaRDI portal
Publication:3630408
DOI10.1080/01630560902841187zbMath1190.90195MaRDI QIDQ3630408
Publication date: 29 May 2009
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a910368090
Related Items
Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions, \(L\)-invex-infine functions and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Some nondifferentiable multiobjective programming problems
- Optimality conditions in multiobjective differentiable programming
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- \((p,r)\)-invexity in multiobjective programming.
- Optimality and duality for multiple-objective optimization under generalized type I univexity
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Proper efficiency and the theory of vector maximization
- On sufficiency and duality for generalised quasicnvex nonsmooth programs
- Nondifferentiable optimization by smooth approximations
- A duality theorem for non-linear programming
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- Efficiency and generalised convexity in vector optimisation problems
- Nonsmooth invex functions and sufficient optimality conditions
- Multiobjective programming under generalized type I invexity
