A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem

In this paper, we consider the sum of linear ratios problem (SLR) that is known to be NP-hard and often arises in various practical applications such as data envelopment analysis and financial investment. We first introduce an equivalent problem (EP) of SLR that involves differences of square terms...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Numerical algorithms Jg. 93; H. 3; S. 1373 - 1400
Hauptverfasser:	Peiping, Shen, Yafei, Wang, Dianxiao, Wu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.07.2023 Springer Nature B.V
Schlagworte:	Algebra Algorithms Approximation Branch and bound methods Computer Science Data envelopment analysis Iterative methods Linear functions Linear programming Mathematical analysis Numeric Computing Numerical Analysis Optimization Original Paper Rectangles Theory of Computation Variables Global optimization 90C30 Branch and bound 90C33 Second-order cone approximations 90C15 Sum of linear ratios problem Convergence analysis
ISSN:	1017-1398, 1572-9265
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!