Multiobjective programming under \((\varphi,d)\)-V-type I univexity
From MaRDI portal
Publication:260510
DOI10.1007/s12597-013-0164-zzbMath1332.90238OpenAlexW2138568236MaRDI QIDQ260510
Divya Agarwal, Deepa Sinha, Pallavi Kharbanda
Publication date: 21 March 2016
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-013-0164-z
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ On the Fritz John saddle point problem for differentiable multiobjective optimization
Cites Work
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
- Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
- Some nondifferentiable multiobjective programming problems
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- \(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
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Strong and Weak Convexity of Sets and Functions
- Optimization and nonsmooth analysis
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- Further Generalizations of Convexity in Mathematical Programming
- Multiobjective programming under generalized type I invexity
- Multiobjective programming under \(d\)-invexity
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Multiobjective programming under \((\varphi,d)\)-V-type I univexity
