A new deterministic global computing algorithm for solving a kind of linear fractional programming

This paper investigates a class of linear fractional programming (LFP) problem, which minimizes the sum of a finite number of linear fractional functions over a polyhedral region. Firstly, the equivalence problem (EP) of the LFP problem is given by a new two-stage transformation method. Secondly, co...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 72; číslo 6; s. 1485 - 1513
Hlavní autori:	Zhang, Bo, Gao, YueLin, Liu, Xia, Huang, XiaoLi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis 03.06.2023 Taylor & Francis LLC
Predmet:	Algorithms branch and bound Global optimization linear fractional programming Mathematical programming Optimization output-space
ISSN:	0233-1934, 1029-4945
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!