Global optimization algorithm for solving linear multiplicative programming problems

In this paper, a class of linear multiplicative problems (LMP) are considered, which cover many applications and are known to be NP-hard. For finding the globally optimal solution to problem (LMP) with a pre-specified ε-tolerance, problem (LMP) is first transformed into an equivalent problem (EP) vi...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 71; číslo 6; s. 1421 - 1441
Hlavní autori:	Shen, Peiping, Wang, Kaimin, Lu, Ting
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis 03.06.2022 Taylor & Francis LLC
Predmet:	Algorithms branch and bound Branch and bound methods computational complexity Global optimization linear multiplicative programming linear relaxation technique Upper bounds
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!