Global algorithm for solving linear multiplicative programming problems
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1378-z
Abstract: This article presents a rectangular branch-and-bound algorithm with standard bisection rule for solving linear multiplicative problem (LMP). In this algorithm, a novel linear relaxation technique is presented for deriving the linear relaxation programming of problem… read more here.
Keywords: problem lmp; linear multiplicative; programming problems; solving linear ... See more keywords
An Accelerating Algorithm for Linear Multiplicative Programming Problem
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.3031354
Abstract: By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP). Firstly, a linear relaxed programming… read more here.
Keywords: programming problem; linear multiplicative; multiplicative programming; problem ... See more keywords