An Iterative Algorithm for Min-max Programming Problem with Addition-min Fuzzy Relational Inequalities in P2P File Sharing Systems

In this paper, we formulate the P2P file sharing system into addition-min fuzzy relation inequalities. The objective of the problem is to minimize the network congestion of the P2P file sharing system. To reduce this factor, we have considered the min-max optimization problem subject to addition-min fuzzy relation inequalities. To solve this problem, we first discuss some properties of addition-min fuzzy relation inequalities. Using these properties, notion of binding variables is introduced and an iterative algorithm is proposed based on greedy approach. The algorithm is designed in such a way that the maximum value corresponding to the component of the solution vector remains as small as possible. The proposed greedy algorithm provides the approximate optimal solution for the problem. The sufficiency condition for the optimality of the solution is also derived. The proposed algorithm is illustrated using some examples.

Authors

Institutions

Publication Details

Journal
Asian Research Journal of Mathematics
Published
2025-05-22
DOI
https://doi.org/10.9734/arjom/2025/v21i5936
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Iterative Algorithm for Min-max Programming Problem with Addition-min Fuzzy Relational Inequalities in P2P File Sharing Systems

Antika Thapar, Richa Bansal, Mohit Katara
Asian Research Journal of Mathematics
Optimization and Search Problems
article

An Iterative Algorithm for Min-max Programming Problem with Addition-min Fuzzy Relational Inequalities in P2P File Sharing Systems

Antika Thapar, Richa Bansal, Mohit Katara
article en

Abstract

In this paper, we formulate the P2P file sharing system into addition-min fuzzy relation inequalities. The objective of the problem is to minimize the network congestion of the P2P file sharing system. To reduce this factor, we have considered the min-max optimization problem subject to addition-min fuzzy relation inequalities. To solve this problem, we first discuss some properties of addition-min fuzzy relation inequalities. Using these properties, notion of binding variables is introduced and an iterative algorithm is proposed based on greedy approach. The algorithm is designed in such a way that the maximum value corresponding to the component of the solution vector remains as small as possible. The proposed greedy algorithm provides the approximate optimal solution for the problem. The sufficiency condition for the optimality of the solution is also derived. The proposed algorithm is illustrated using some examples.

Asian Research Journal of MathematicsVol. 21(5)
Dayalbagh Educational Institute (IN)
Openalex Percentile: Top 89%
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Iterative Algorithm for Min-max Programming Problem with Addition-min Fuzzy Relational Inequalities in P2P File Sharing Systems — Antika Thapar, Richa Bansal, et al. · Asian Research Journal of Mathematics (2025) | TGRS Research Map | TGRS