On higher-order converse duality for nondifferentiable multiobjective programming problems

DOI10.3969/J.ISSN.1008-5513.2014.02.003MaRDI QIDQ5497802zbMATH OpenFDO

Authors Ying Gao

Publication date 11 February 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1008-5513.2014.02.003

zbMATH Keywords

converse duality theoremshigher-order dual modelsnondifferentiable multiobjective programming problems

Mathematics Subject Classification ID

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

Recommendations

• Higher-order Mond-Weir converse duality in multiobjective programming involving cones
• Higher order symmetric duality in nondifferentiable multiobjective programming problems involving cones
• Higher-order duality in multiobjective programming problems with cone constraints
• On nondifferentiable higher-order symmetric duality in multiobjective programming involving cones
• Nondifferentiable higher order duality in multiobjective programming involving cones

Cited in

(5)

• Higher-order Mond-Weir converse duality in multiobjective programming involving cones
• Higher-order duality in multiobjective programming problems with cone constraints
• Converse duality for non-differentiable multi-objective fractional programming
• On second-order converse duality for a nondifferentiable programming problem
• A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming

This page was built for publication: On higher-order converse duality for nondifferentiable multiobjective programming problems

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