Efficiency and duality in nonsmooth multiobjective programming with (F,,,)-d-V-univexity

MaRDI QIDQ3171638zbMATH OpenFDO

Authors I. Ahmad

Publication date 5 October 2011

zbMATH Keywords

nonsmooth multiobjective programming problem efficient solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
• Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
• Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions
• On nonsmooth multiobjective programming with generalized univexity

Cited in

(2)

• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
• Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions

This page was built for publication: Efficiency and duality in nonsmooth multiobjective programming with \((F,\alpha,\rho,\theta)\)-\(d\)-\(V\)-univexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171638)