Abstract
This paper investigates the affine sum-of-ratios problem (SRP) which has numerous applications in many fields of economy and engineering. For globally computing the affine SRP, based on equivalent transformation and new affine relaxation problem, a reduced outer space branch-and-bound algorithm is designed. The designed algorithm has been proven to converge to a global optimal solution of the problem (SRP) eventually. Meanwhile, the maximum iteration time for the algorithm in the worst case is estimated by analyzing its computational complexity. Finally, numerical experimental results indicate that the presented algorithm is robust and effective.
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.
