원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.8 No.12
2015.12
pp.63-70
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
This paper deals with the duality for a class of multiobjective programming problems including inequality constraints. To establish and prove the dual results for the multiobjective programming problems, the dual models and the classes of generalized invexity functions so-called F J - d - αβ - Ρt - θ - pseudoinvex-I are introduced. Using the new concepts, the weak dual, strong dual and converse dual theorems are obtained for the multiobjective programming problems.
목차
Abstract
1. Introduction
2. Notations and Preliminaries
3. Mond-Weir Duality
4. Discussion and Conclusion
References
1. Introduction
2. Notations and Preliminaries
3. Mond-Weir Duality
4. Discussion and Conclusion
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보