Nonsmooth multiobjective optimization involving generalized univex functions
From MaRDI portal
Publication:289661
DOI10.1007/s12597-013-0135-4zbMath1337.90058OpenAlexW2043042943MaRDI QIDQ289661
Deepa Sinha, Divya Agarwal, Pallavi Kharbanda
Publication date: 30 May 2016
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-013-0135-4
Numerical mathematical programming methods (65K05) Convex programming (90C25) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions ⋮ Global efficiency for multiobjective bilevel programming problems under generalized invexity
Cites Work
- Unnamed Item
- Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
- Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
- Some nondifferentiable multiobjective programming problems
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
- On sufficiency of the Kuhn-Tucker conditions
- \(D\)-invexity and optimality conditions
- On multiple-objective optimization with generalized univexity
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Optimality and duality with generalized convexity
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
- Nonlinear Programming
- Multiobjective programming under generalized type I invexity
- Multiobjective programming under \(d\)-invexity
This page was built for publication: Nonsmooth multiobjective optimization involving generalized univex functions
