Show simple item record

dc.contributor.authorLeung, Janny M. Y.en_US
dc.contributor.authorMagnanti, Thomas L.en_US
dc.date.accessioned2004-05-28T19:34:13Z
dc.date.available2004-05-28T19:34:13Z
dc.date.issued1986-05en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5333
dc.description.abstractRecently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems.In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure.The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with constant capacity K for all plants. These facet inequalities depend on K and thus differ fundamentally from the valid inequalities for the uncapacitated version of the problem. We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.en_US
dc.format.extent2601321 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 149-86en_US
dc.titleValid Inequalities and Facets of the Capacitated Plant Location Problemen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record