Abstract
The problem of characterizing extreme points of a family of polyhedra is considered. This family embraces a variety of linear relaxations of feasible regions of discrete location problems. After characterizing the extreme points by means of a homogeneous system of linear equations, we obtain, as particular cases, four problems which have already been treated from a polyhedral point of view in the literature. Finally, we show that our characterization improves the one known for the Simple Plant Location Problem and corrects the one established for the Two-Level Uncapacitated Facility Location Problem.
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.
