Mixed type converse duality in multiobjective programming problems

DOI10.1016/J.JMAA.2004.09.031MaRDI QIDQ1772307zbMATH OpenOpenAlexFDO

Authors Kok Lay Teo, Xinmin Yang, Xiao Qi Yang

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
• Generalized invexity and duality in multiobjective programming problems
• Lagrangean conditions and quasiduality
• Mixed type duality in multiobjective programming problems
• Pre-invex functions in multiple objective optimization
• Proper efficiency and the theory of vector maximization
• SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY

Cited in

(2)

• scientific article; zbMATH DE number 7347486 (Why is no real title available?)
• Mixed type duality in multiobjective programming problems

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

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