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á bibliografie

Vydáno v:	Optimization Ročník 71; číslo 6; s. 1421 - 1441
Hlavní autoři:	Shen, Peiping, Wang, Kaimin, Lu, Ting
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia Taylor & Francis 03.06.2022 Taylor & Francis LLC
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!