Higher-order Mond-Weir converse duality in multiobjective programming involving cones

DOI10.1007/s11425-013-4700-3zbMath1288.90089MaRDI QIDQ2441147

Jin Yang, Tsz-leung Yip, Yang, Xinmin, Kok Lay Teo

Publication date: 21 March 2014

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-013-4700-3

zbMATH Keywords

multiobjective programming; cones; converse duality theorem; higher-order Mond-Weir dual model

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C29: Multi-objective and goal programming

90C30: Nonlinear programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems, Higher-order symmetric duality for multiobjective programming with cone constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Higher-order symmetric duality in multiobjective programming with invexity
• Second- and higher-order duality in nonlinear programming
• Higher-order symmetric duality in nondifferentiable multiobjective programming problems.
• Higher-order generalized invexity and duality in mathematical programming
• Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
• Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
• Higher order duality in multiobjective programming with cone constraints
• Lagrangean conditions and quasiduality