An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem

This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, b...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical problems in engineering Ročník 2021; s. 1 - 10
Hlavní autoři: Jia, Pujun, Jiao, Hongwei, Shi, Dongwei, Yin, Jingben
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Hindawi 27.11.2021
John Wiley & Sons, Inc
Témata:
Algorithms
Lower bounds
Mathematical problems
Mathematical programming
Minimax technique
Optimization
Ratios
ISSN:1024-123X, 1563-5147
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, by introducing auxiliary variables, we first equivalently transform the problem (MLFP) into the problem (EP). By using a new linear relaxation technique, the problem (EP) is reduced to a sequence of linear relaxation problems over the outer space rectangle, which provides the valid lower bound for the optimal value of the problem (EP). Based on the outer space branch-and-bound search and the linear relaxation problem, an outer space branch-and-bound algorithm is constructed for globally solving the problem (MLFP). In addition, the convergence and complexity of the presented algorithm are given. Finally, numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1024-123X
1563-5147
DOI:10.1155/2021/3584494