Sufficiency and duality for multiobjective programming under new invexity
From MaRDI portal
Recommendations
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
- On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
- scientific article; zbMATH DE number 7009380
Cites work
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- Higher-order symmetric duality with higher-order generalized invexity
- Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems
- On G-invex multiobjective programming. II: Duality
- On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
- Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions
- Optimality conditions and duality in nonsmooth multiobjective programs
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under (, )-invexity
- Second order symmetric duality in nondifferentiable multiobjective fractional programming with cone convex functions
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (\(\Phi\), \(\rho\))-\(V\)-type I functions
- \((\Phi , \rho )\)-invexity in nonsmooth optimization
Cited in
(4)- New sufficiency for global optimality and duality of nonlinear multi-objective programming problems via underestimators
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Multiobjective programming with new invexities
- SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
This page was built for publication: Sufficiency and duality for multiobjective programming under new invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793665)