LMP minimizes the product of two linear functions subject to general linear constraints. The product of two linear functions is a typical non-convex function, so that it can have multiple local minima.
People also ask
What are the three types of linear programming?
What does LPP mean linear programming?
What is linear time programming?
What is an example of a linear programming technique?
Aug 9, 2016 · In this paper, we put forward a fast global optimization algorithm for generalized linear multiplicative programming problem (GLMP). Our ...
The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints.
The linear multiplicative programming is the minimization of the product of affine functions over a polyhedral set. The problem with two affine functions ...
In this paper, a class of linear multiplicative problems (LMP) are considered, which cover many applications and are known to be NP-hard.
Sep 26, 2024 · In this article, we consider a general linear multiplicative problem (GLMPP) arising from the practical applications in numerous fields. A new ...
Oct 15, 2020 · By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new ...
Jul 9, 2024 · This article proposes a rectangular branch-and-bound algorithm for solving linear multiplication problems (LMP) globally.
In this study, we propose a novel global optimization algorithm for effectively solving the generalized linear multiplicative problem with generalized ...
(PDF) Heuristic Methods for Linear Multiplicative Programming
www.researchgate.net › ... › Heuristics
The linear multiplicative programming is the minimization of the product of affine functions over a polyhedral set. The problem with two affine functions ...