Abstract
We present a dual ascent and adjustment procedure for the linear programming relaxation of the exact formulation of the simple plant location problem with spatial interaction, which is a pure zero-one location model (an extension of the classical simple plant location problem). The procedure is based on the same principles as the dual ascent method of Erlenkotter for the uncapacitated facility location problem, with some important technical differences. Some computational results are given
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.
