首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A compromise procedure for the multiple objective linear fractional programming problem
Authors:Ireneusz Nykowski  Zbigniew Zołkiewski
Institution:Department of Econometrics, Central School of Planning and Statistics, 02-554 Warsaw, Al. Niepodleglosci 162, Poland;Research Center for Economics and Statistics Warsaw, Poland
Abstract:A generalization of a well-known multiple objective linear fractional programming (MOLFP) problem, the multiple objective fractional programming (MOFP) problem, is formulated. A concept of multiple objective programming (MOP) problem corresponding to MOFP is introduced and some relations between those problems are examined. Based on these results, a compromise procedure for MOLFP problem is proposed. A numerical example is given to show how the procedure works.
Keywords:Bicreteria linear programming  multiple decision making  multiple objective fractional programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号