Mixed type converse duality in multiobjective programming problems

DOI10.1016/j.jmaa.2004.09.031zbMath1075.90069OpenAlexW2004055499MaRDI QIDQ1772307

Kok Lay Teo, Xiao Qi Yang, Yang, Xinmin

Publication date: 18 April 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.09.031

zbMATH Keywords

Converse dualityFritz John necessary conditionMixed type dual modelMultiobjective programming problem

Mathematics Subject Classification ID

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

Cites Work

• A converse duality theorem in multiple objective programming
• Pre-invex functions in multiple objective optimization
• Mixed type duality in multiobjective programming problems
• Proper efficiency and the theory of vector maximization
• SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
• Lagrangean conditions and quasiduality
• Generalized invexity and duality in multiobjective programming problems

This page was built for publication: Mixed type converse duality in multiobjective programming problems