Generalized invexity and duality in multiobjective programming problems

From MaRDI portal





The paper generalizes the concept of type I functions introduced by Hanson and Mond (1987) to vector-valued functions in order to develop duality results for nonlinear multiobjective programming problems with inequality constraints. Under these generalized type I assumptions, Mond-Weir and generalized Mond-Weir type duals are formulated and the concept of efficiency is used to state weak, strong and converse duality theorems.




Cited in
(78)








This page was built for publication: Generalized invexity and duality in multiobjective programming problems

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