Abstract
In this paper, we address the development of efficient global search methods for a sum of ratios (i.e. a fractional programming) problem. This is, in general, a nonconvex problem (with numerous local extremum) which belongs to a class of global optimization problems. We proved the reduction theorem for the fractional programming problem with the d.c. functions and one equation with the vector parameter that satisfy the nonnegativity assumption. This theorem allows a justified use of the Dinkelbach’s approach to solving fractional programming problems with the goal function given by d.c. functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.