Higher-order duality in multiobjective programming problems with cone constraints

DOI10.3969/J.ISSN.1008-5513.2015.01.009MaRDI QIDQ3196166zbMATH OpenFDO

Authors Ying Gao, Hongmei Li

Publication date 28 October 2015

zbMATH Keywords

generalized convexityduality theoremsmulti-objective programming problems with cone constraints

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)

Recommendations

• Higher order duality in multiobjective programming with cone constraints
• Second order duality for multiobjective programming with cone constraints
• Duality in multiobjective programming with cone constraints
• On higher-order converse duality for nondifferentiable multiobjective programming problems
• Duality for second-order symmetric multiobjective programming with cone constraints

Cited in

(5)

• On higher-order converse duality for nondifferentiable multiobjective programming problems
• Second order duality for multiobjective programming with cone constraints
• Duality in multiobjective programming with cone constraints
• Higher order duality in multiobjective programming with cone constraints
• Higher-order duality for multiobjective optimization problems containing support functions over cones

This page was built for publication: Higher-order duality in multiobjective programming problems with cone constraints

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