Resolution of the sec-max-product fuzzy relation inequalities and its lexicographic minimum solution ∗

preprint OA: closed
View at publisher

Abstract

In this paper we consider the wireless Server-to-Client (S2C) network system with server peers and user (client) peers. The server peers provide the data resources to the user peers. In order to describe the wireless S2C network system in which there exists at least one candidate server for each user, we define and investigate the so-called sec-max-product fuzzy relation inequalities. Basic properties and the structure of the solution set have been studied for the sec-max-product fuzzy relation inequalities system. Moreover, the optimal solution under a lexicographic order is further proposed and studied for such sec-max-product system, which is able to minimize all the variables under some fixed priority grade. In addition, an efficient resolution algorithm is developed with illustrative examples.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00