Abstract

In this paper, a deterministic method is presented for globally solving the sum of linear ratios problem over convex feasible region. The proposed approach is based on the branch and bound scheme. First, by introducing new variables and using concave envelope, the fundamental problems for estimating upper bounds in the branch and bound algorithm change into a sequence of relaxation convex programming problems which have less variables and constraints. Next, a new bounding tightening strategy is proposed to enhance solution produce. Finally, the analysis theory and numerical experiments are reported on the feasibility and efficiency of the proposed algorithm.

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 call

Disclaimer: 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.