Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions
From MaRDI portal
Publication:1004015
DOI10.1016/j.cam.2008.07.028zbMath1216.90068OpenAlexW1963763390MaRDI QIDQ1004015
Publication date: 2 March 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.07.028
optimality conditionsdualitynondifferentiable multiobjective programming(weak) Pareto optimal solution\(d\)-\(r\)-type I objective and constraint functions
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Optimality conditions and duality in nonsmooth multiobjective optimization problems ⋮ Sufficiency and duality for multiobjective programming under new invexity
Cites Work
- Unnamed Item
- Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- Multiobjective duality with invexity
- Optimality criteria in mathematical programming involving generalized invexity
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- \(D\)-invexity and optimality conditions
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- On invex sets and preinvex functions
- Nonsmooth invexity
- Nondifferentiable optimization by smooth approximations
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- A duality theorem for non-linear programming
- Invex functions and constrained local minima
- On generalised convex mathematical programming
- Generalized (p, r)-Invexity in Mathematical Programming
- \((p,r)\)-invex sets and functions
- Multiobjective programming under \(d\)-invexity
