Article contents
Duality and Lagrange multipliers for nonsmooth multiobjective programming
Published online by Cambridge University Press: 17 April 2009
Extract
Without any constraint qualification, the necessary and sufficient optimality conditions are established in this paper for nonsmooth multiobjective programming involving generalised convex functions. With these optimality conditions, a mixed dual model is constructed which unifies two dual models. Several theorems on mixed duality and Lagrange multipliers are established in this paper.
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 74 , Issue 3 , December 2006 , pp. 369 - 383
- Copyright
- Copyright © Australian Mathematical Society 2006
References
- 1
- Cited by