Multiobjective Programming Problems Under Generalized Convexity
In this chapter, we consider optimality conditions and duality for some multiobjective programming problems with generalized convexity. In particularly, the general multiobjective programming, multiobjective fractional programming and multiobjective variational programming will be discussed.
Unable to display preview. Download preview PDF.
- [CP05]Chinchulmm, A., Pardalos, P.M.: Recent developments in multiobjective optimization. Annals of Operations Research, to appear (2005)Google Scholar
- [CYP05]Chinchuluun, A., Yuan, D.H., Pardalos, P.M.: Optimality conditions and duality for nondifferentiable multiobjective fractional programming with genreralized convexity. Annals of Operations Research, to appear (2005)Google Scholar
- [YCLP05]Yuan, D.H., Chinchuluun, A., Liu, X.L., Pardalos, P.M.: Optimality conditions and duality for multiobjective programming involving (C, α, ρ, d) type-I functions. In: Proceedings of 8th International Symposium on Generalized Convexity Generalized Monotonicity, submitted (2005)Google Scholar
- [YLCP05]Yuan, D.H., Liu, X.L., Chinchuluun, A., Pardalos, P.M.: Nondifferentiable minimax fractional programming problems. Journal of Optimization Theory and Applications, to appear (2005)Google Scholar