Abstract
Abstract The problem of maximizing the sum of m concave-convex fractional functions on a convex set is shown to be equivalent to the one whose objective function f is the sum of m linear fractional functions defined on a suitable convex set; successively, f is transformed into the sum of one linear function and (m — 1) linear fractional functions. As a special case, the problem of maximizing the sum of two linear fractional functions subject to linear constraints is considered. Theoretical properties are studied and an algorithm converging in a finite number of iterations is proposed.
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.
