An Accelerating Algorithm for Linear Multiplicative Programming Problem
Published in IEEE • Jan 1, 2020
Authors:,,
Shuai Tang
Zhisong Hou
Longquan Yong
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 problem is constructed, which...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!