Abstract
This paper shows that the problem of minimizing a linear fractional function subject to a system of sup-T equations with a continuous Archimedean triangular norm T can be reduced to a 0-1 linear fractional optimization problem in polynomial time. Consequently, parametrization techniques, e.g., Dinkelbach’s algorithm, can be applied by solving a classical set covering problem in each iteration. Similar reduction can also be performed on the sup-T equation constrained optimization problems with an objective function being monotone in each variable separately. This method could be extended as well to the case in which the triangular norm is non-Archimedean.
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.
