Optimality and duality for multiobjective fractional programming involving n-set functions

被引:7
|
作者
Kim, DS [1 ]
Jo, CL [1 ]
Lee, GM [1 ]
机构
[1] Pukyong Natl Univ, Dept Appl Math, Pusan 608737, South Korea
关键词
D O I
10.1006/jmaa.1998.5974
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider a multiobjective fractional programming problem (MFP) involving vector-valued objective n-set functions in which their numerators are different from each other, but their denominators are the same. By using the concept of proper efficiency, we establish optimality conditions and duality relations for our problem (MFP) under convexity assumptions on objective and constrained functions. (C) 1998 Academic Press.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 50 条