Optimizing linear functions over novel fuzzy relation equations: Structure, feasibility, and global solutions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F25%3A73634207" target="_blank" >RIV/61989592:15310/25:73634207 - isvavai.cz</a>

Výsledek na webu

<a href="https://ijfs.usb.ac.ir/article_9295_d2ec2d0216ee69fa9168ef1065a5b4c3.pdf" target="_blank" >https://ijfs.usb.ac.ir/article_9295_d2ec2d0216ee69fa9168ef1065a5b4c3.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.22111/ijfs.2025.9295" target="_blank" >10.22111/ijfs.2025.9295</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizing linear functions over novel fuzzy relation equations: Structure, feasibility, and global solutions

Popis výsledku v původním jazyce

We investigate the linear objective function optimization problem constrained by a new system of fuzzy relation equations, utilizing the minimum t-norm for fuzzy compositions. Our findings reveal that the feasible region is characterized as a finite union of closed convex cells. We provide necessary and sufficient conditions to determine the problem&apos;s feasibility. To streamline optimization, seven novel rules are proposed, on which an algorithm is based to achieve a global optimum. Notably, a specific instance of our problem is shown to be equivalent to the well-known minimal vertex cover problem. The efficacy of our algorithm is demonstrated through a concrete example.

Název v anglickém jazyce

Optimizing linear functions over novel fuzzy relation equations: Structure, feasibility, and global solutions

Popis výsledku anglicky

We investigate the linear objective function optimization problem constrained by a new system of fuzzy relation equations, utilizing the minimum t-norm for fuzzy compositions. Our findings reveal that the feasible region is characterized as a finite union of closed convex cells. We provide necessary and sufficient conditions to determine the problem&apos;s feasibility. To streamline optimization, seven novel rules are proposed, on which an algorithm is based to achieve a global optimum. Notably, a specific instance of our problem is shown to be equivalent to the well-known minimal vertex cover problem. The efficacy of our algorithm is demonstrated through a concrete example.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Iranian Journal of Fuzzy Systems

ISSN

1735-0654

e-ISSN

—

Svazek periodika

22

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

IR - Íránská islámská republika

Počet stran výsledku

29

Strana od-do

151-179

Kód UT WoS článku

001547238100001

EID výsledku v databázi Scopus

2-s2.0-105011310853