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

Full description

Bibliographic Details

Published in:	Journal of computational and applied mathematics Vol. 407; p. 114080
Main Authors:	Wang, Chunfeng, Deng, Yaping, Shen, Peiping
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2022
Subjects:	Branch and bound Complexity Convex relaxation Global convergence LMP Convex relaxation Global convergence Branch and bound LMP Complexity
ISSN:	0377-0427, 1879-1778
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!