Abstract
Optimizing the sum of linear fractional functions over a set of linear inequalities (S-LFP) has been considered by many researchers due to the fact that there are a number of real-world problems which are modelled mathematically as S-LFP problems. Solving the S-LFP is not easy in practice since the problem may have several local optimal solutions which makes the structure complex. To our knowledge, existing methods dealing with S-LFP are iterative algorithms that are based on branch and bound algorithms. Using these methods requires high computational cost and time. In this paper, we present a non-iterative and straightforward method with less computational expenses to deal with S-LFP. In the method, a new S-LFP is constructed based on the membership functions of the objectives multiplied by suitable weights. This new problem is then changed into a linear programming problem (LPP) using variable transformations. It was proven that the optimal solution of the LPP becomes the global optimal solution for the S-LFP. Numerical examples are given to illustrate the method.
Funder
Universiti Kebangsaan Malaysia
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference33 articles.
1. Programming, Profit Rates and Pricing Decisions;Colantoni;Account. Rev.,1969
2. Parametric Analysis of a Multi-Stage Stochastic Shipping Problem;Almogy;Oper. Res. Int. J.,1970
3. Cluster Analysis and Mathematical Programming
4. BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
5. Queueing-location problems on the plane
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献