Abstract
In recent years, the absolute value equation (AVE) has attracted growing attention. The absolute value program (AVP) is an extension of AVE, which contains absolute values of variables in its objective function and constraints. In this article, we propose an algorithm for the AVP, which is based on the branch-and-bound method. In the branching procedure, we generate two subproblems by restricting the sign of a variable to be nonnegative or nonpositive. In the bounding procedure, we utilize the duality results for AVP. Furthermore, we carry out numerical experiments for nonconvex multi-facility location problems to show the validity of the proposed algorithm.
Sign-in/Register to access full text options 
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.
