Abstract
In this paper a new formulation of the simple plant location problem (SPLP) is given that uses the style of Sharma and Sharma (European Journal of Operational Research, 122(3), 37–48). When the integer restrictions are relaxed, it results in a new relaxation of SPLP that is different from the already well known "strong" and "weak" relaxation of SPLP. It is shown that the bound given by the new relaxation is worse than the bound given by "strong relaxation" of SPLP. However, a numerical example illustrates that the bound given by the new relaxation can at times be better than the bound given by "weak relaxation" (already known) of SPLP. In this paper a new proof [which is different from the one given by Bilde and Krarup (Annals of Discrete Mathematics, 1, 79–97)] is given to establish relative strengths of various relaxations of SPLP.
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.
