Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
From MaRDI portal
Publication:741864
DOI10.1007/s11424-013-1089-6zbMath1298.90097OpenAlexW2128372881MaRDI QIDQ741864
Publication date: 15 September 2014
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-013-1089-6
dualitymultiobjective programmingweakly efficient solutionsufficient optimality conditionnonsmooth pseudounivexitynonsmooth quasiunivexitynonsmooth univexity
Related Items (2)
Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions ⋮ Sufficiency and duality for nonsmooth multiobjective fractional programming problems involving \((\Phi,\rho,\alpha)\)-\(V\)-invexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and duality for minimax fractional programming involving nonsmooth generalized univexity
- Generalized convexity and vector optimization.
- Semi-B-preinvex functions
- Pareto optimality, game theory and equilibria
- Invexity and optimization
- On sufficiency of the Kuhn-Tucker conditions
- \(D\)-invexity and optimality conditions
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- V-invex functions and vector optimization.
- SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- Optimization and nonsmooth analysis
- On generalised convex mathematical programming
- Nonsmooth Invexity in Multiobjective Programming
- Regularity Conditions and Optimality in Vector Optimization
- Multiobjective programming under \(d\)-invexity
This page was built for publication: Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
