Abstract
ABSTRACT This paper studies a class of linear multiplicative problems (LMP). To find a global optimal solution of problem (LMP), we first convert problem (LMP) into an equivalent problem (EP) via auxiliary variables, then problem (EP) is expressed as a two-layer problem (EP1). On the basis of problems (EP) and (EP1), a new bounding technique which integrates two linear relaxation processes is proposed to obtain a valid lower bound for the optimal value of (LMP). Combining the bounding technique with the bisection branching rule, a novel branch and bound algorithm is designed. Also, we establish the global convergence of the proposed algorithm and estimate its computational complexity. Preliminary numerical results verify the feasibility and effectiveness of the presented method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
