Abstract
In the existing works, system of addition-min fuzzy relation inequalities (FRIs) was introduced to model a peer-to-peer (P2P) file sharing system. For decreasing the network congestion, a minimax programming has been studied. However, in such programming, the different weights of the terminals (or peers) were not considered. In order to distinguish the different importance degrees of the terminals, we propose and investigate the weighted minimax programming problem in this work. A novel algorithm based on some discrete function-values is developed to obtain its optimal solution. Effectiveness of our proposed algorithms are further illustrated by some numerical examples.
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.
