Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming
From MaRDI portal
Publication:1949584
DOI10.1007/s10957-012-0123-5zbMath1262.90155MaRDI QIDQ1949584
Gabriel Ruiz-Garzón, Manuel Arana-Jiménez, Beatriz Hernández-Jiménez, Rafaela Osuna-Gómez
Publication date: 8 May 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0123-5
duality; multiobjective programming; pseudoinvexity; Fritz John optimality conditions; weak Pareto solutions
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
On directionally differentiable multiobjective programming problems with vanishing constraints, On sufficient optimality conditions for multiobjective control problems, Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
- A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
- Multiobjective duality with invexity
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- \(D\)-invexity and optimality conditions
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- On invex sets and preinvex functions
- A characterization of pseudoinvexity in multiobjective programming
- Pseudoinvexity, optimality conditions and efficiency in multiobjective problems; duality
- Generalized nonsmooth invexity over cones in vector optimization
- Nonsmooth invexity
- Nondifferentiable optimization by smooth approximations
- What is invexity?
- Convex Transformable Programming Problems and Invexity
- Invex functions and constrained local minima
- Multiobjective programming under \(d\)-invexity
