Abstract

This paper proposes an algorithm for solving a linear fractional functionals program when some of its constraints are homogeneous. Using these homogeneous constraints a transformation matrix T is constructed. Matrix T transforms the given problem into another linear fractional functional program but with fewer constraints. A relationship between these two problems, which ensures that the solution of the original problem can be recovered from the solution of the transformed problem, is established. A simple numerical example illustrates the steps 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.