Abstract
We consider the nonlinear multiobjective programming problems involving cone constraints. For this program, we construct higher order dual problems and establish weak, strong and converse duality theorems for an efficient solution by using higher order generalized invexity conditions due to Zhang (Higher order convexity and duality in multiobjective programming, in “Progress in Optimization”, Contributions from Australasia, Applied Optimization, Vol. 30, eds. A. Eberhard, R. Hill, D. Ralph and B.M. Glover, Kluwer Academic Publishers, Dordrecht, 1999, 101–116). As special cases of our duality relations, we give some known duality results.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
