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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Numerical algorithms Ročník 93; číslo 3; s. 1373 - 1400
Hlavní autori:	Peiping, Shen, Yafei, Wang, Dianxiao, Wu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!