Abstract
By considering the concept of weak minima, different scalar duality results are extended to multiple objective programming problems. A number of weak, strong and converse duality theorems are given under a variety of generalised convexity conditions.
Publisher
Cambridge University Press (CUP)
Reference18 articles.
1. A duality theorem for non-linear programming
2. Vector maximisation and lagrange multipliers
3. [14] Weir T. , ‘Generalized Convexity and Duality in Mathematical Programming’, Ph.D. Thesis. (La Trobe University, Bundoora, Melbourne, Australia, 1982).
4. Proper efficiency and duality for vector valued optimization problems
Cited by
101 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献