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

Full description

Bibliographic Details

Published in:	Optimization Vol. 71; no. 6; pp. 1421 - 1441
Main Authors:	Shen, Peiping, Wang, Kaimin, Lu, Ting
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 03.06.2022 Taylor & Francis LLC
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!