A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems

Linear multiplicative programming (LMP) problems have many applications, although their solving can be difficult. To solve LMPs, we propose a convex approximation approach with a standard partition in intervals. First, a novel convex relaxation strategy is designed, which is used to obtain a convex...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of computational and applied mathematics Ročník 407; s. 114080
Hlavní autoři:	Wang, Chunfeng, Deng, Yaping, Shen, Peiping
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.06.2022
Témata:	Branch and bound Complexity Convex relaxation Global convergence LMP Convex relaxation Global convergence Branch and bound LMP Complexity
ISSN:	0377-0427, 1879-1778
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!