A Single-Variable Method for Solving the Min–Max Programming Problem with Addition–Overlap Function Composition

Min–max programming problems with addition–min constraints have been studied in the literature to model data transfer in BitTorrent-like peer-to-peer file-sharing systems. It is well known that the class of overlap functions contains various operators, including the “min” operator. The aim of this p...

Full description

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 12; no. 20; p. 3183
Main Authors Wu, Yan-Kuen, Guu, Sy-Ming, Chang, Ya-Chan
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.10.2024
Subjects
Online AccessGet full text
ISSN2227-7390
2227-7390
DOI10.3390/math12203183

Cover

More Information
Summary:Min–max programming problems with addition–min constraints have been studied in the literature to model data transfer in BitTorrent-like peer-to-peer file-sharing systems. It is well known that the class of overlap functions contains various operators, including the “min” operator. The aim of this paper is to generalize the above min–max programming problem with addition–overlap function constraints. We demonstrate that this new optimization problem can be transformed into a simplified single-variable optimization problem, which makes it easier to find an optimal solution. The bisection method will be used to find this optimal solution. In addition, when the overlap function is explicitly specified, an iterative method is given to compute the optimal objective value with a polynomial time complexity. A numerical example is provided to illustrate the procedures.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math12203183