\(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
From MaRDI portal
Publication:1004626
DOI10.1016/j.na.2008.03.008zbMath1155.90451OpenAlexW1989300652MaRDI QIDQ1004626
Chandal Nahak, Ram N. Mohapatra
Publication date: 11 March 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2008.03.008
Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Nonsmooth multiobjective optimization involving generalized univex functions, Generalized univex functions in nonsmooth multiobjective optimization, Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming, On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \(V-r\)-invex functions, Generalized \((d - \rho - \eta - \theta )\)-type I univex functions in multiobjective optimization, Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions, Mixed type duality for nondifferentiable multiobjective fractional programming under generalized \((d,\rho, \eta, \theta)\)-type 1 univex function, Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Multiobjective duality with invexity
- On sufficiency of the Kuhn-Tucker conditions
- \(D\)-invexity and optimality conditions
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Mixed type duality in multiobjective programming problems
- Multiobjective duality with \(\rho-(\eta, \theta)\)-invexity
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
- Nonsmooth invexity
- What is invexity?
- Implicit function theorems and lagrange multipliers
- Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions
- Multiobjective programming under \(d\)-invexity