科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we present a new technique to compute the maximum of it weighted sum of the objective functions in multiple objective linear fractional programming (MOLFP) This problem is equivalent to the 'sum-of-ratios case' [14] problem The new technique is ail improvement of the technique presented in Costa [5] which is basically a Branch & Bound approach Now a cut is introduced This cut proves to speed tip the technique in all the tests On average the improvement ranges from 20% to 70% both in terms of running time and in the number of sub-regions Some computational results highlighting the performance of the technique are presented
- 出版日期2010-1
