Abstract
Normally the sum of ratios problems are reduced into a sequence of single-ratio problems and then solved by existing methods. Because of their combinatorial nature, the computational complexity grows exponentially. A sum of non-linear fractional function optimization problem with several fractions is proved to be a NP-complete problem indicating that an efficient algorithm may not exist. The non-linear sum of fractional functions are linearized by piecewise linearization technique and converted into a linear sum of fractional programming problem. Optimal solution is found at for the new problem. The number of iterations depends on the contribution of decision variables to objective function value
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
