Abstract
The Reliability Fixed-Charge Location Problem is an extension of the Simple Plant Location Problem that considers that some facilities have a probability of failure. In this paper we reformulate the original mathematical programming model of the Reliability Fixed-Charge Location Problem as a set packing problem. We study certain aspects of its polyhedral properties, identifying all the clique facets. We also discuss how to obtain facets of the Reliability Fixed-Charge Location Problem from facets of the Simple Plant Location Problem. Subsequently, we study some conditions for optimal solutions. Finally, we propose an improved compact formulation for the problem and we check its performance by means of an extensive computational study.
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.
