Abstract
Recently, 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 a constant capacity for all plants. These facet inequalities depend on the capacity and thus differ fundamentally from the valid inequalities for the uncapacited 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.
Similar content being viewed by others
References
E. Balas and M.W. Padberg, “Set partitioning: A survey,”Siam Review 18 (1976) 710–760.
I. Barany, T.J. Van Roy and L.A. Wolsey, “Multi-item capacitated lot sizing problems,”Management Science 30 (1984) 1255–1261.
G. Bitran, V. Chandru, D. Sempolinski and J. Shapiro, “Inverse optimization: An application to the capacitated plant location problem,”Management Science 27 (1981) 1120–1141.
D.C. Cho, E.L. Johnson, M.W. Padberg and M.R. Rao, “On the uncapacitated plant location problem I: Valid inequalities,”Mathematics of Operations Research 8 (1983a) 579–589.
D.C. Cho, E.L. Johnson, M.W. Padberg and M.R. Rao, “On the uncapacitated plant location problem II: Facets and lifting theorems,”Mathematics of Operations Research 8 (1983b) 590–612.
N. Christofides and J.E. Beasley, “Extensions to a Lagrangian relaxation approach for the capacitated warehouse location problem,”European Journal of Operational Research 12 (1983) 19–28.
G. Cornuejols, M.L. Fisher and G.L. Nemhauser, “Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms,”Management Science 23 (1977a) 789–810.
G. Cornuejols, M.L. Fisher and G.L. Nemhauser, “On the uncapacitated location problem,”Annals of Discrete Mathematics 1 (1977b) 163–177.
G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, “The uncapacitated facility location problem,” MSRR-493, GSIA, Carnegie-Mellon University (Pittsburgh, PA, 1983).
G. Cornuejols and J.-M. Thizy, “Some facets of the simple plant location polytope,”Mathematical Programming 23 (1982) 50–74.
H. Crowder, E.L. Johnson and M.W. Padberg, “Solving large-scale zero–one linear programming problems,”Operations Research 31 (1983) 803–834.
H. Crowder and M.W. Padberg, “Solving large scale symmetric travelling salesman problems to optimality,”Management Science 26 (1980) 495–509.
G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale travelling salesman problem,”Operations Research 2 (1954) 394–410.
D.P. Dykstra and J.L. Riggs, “An application of facilities location theory to the design of forest harvesting areas,”AIIE Transactions 9 (1977) 270–277.
G.D. Eppen and R.K. Martin, “Solving multi-item capacitated lot sizing problems using variable redefinition,”Operations Research 35 (1987) 832–848.
M.L. Fisher and D.S. Hochbaum, “Database location in computer networks,”Journal of the ACM 27 (1980) 718–735.
A.M. Geoffrion and R. McBride, “Lagrangian relaxation applied to capacitated facility location problems,”AIIE Transactions 10 (1978) 40–48.
M. Grötschel, “Polyhedral combinatorics,” in: M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (Wiley, New York, 1985) pp. 1–10.
M. Grötschel, M. Jünger and G. Reinelt, “A cutting plane algorithm for the linear ordering problem,”Operations Research 32 (1984) 1195–1220.
M Grötschel, M. Jünger and G. Reinelt, “Facets for the linear ordering problem,”Mathematical Programming 33 (1985) 43–60.
M. Grötschel, L. Lovász and A. Schrijver, “The consequences of the ellipsoid method for combinatorial optimization,”Combinatorica 1 (1981) 169–198.
M. Guignard, “Fractional vertices, cuts and facets of the simple plant location problem,”Mathematical Programming 12 (1980) 150–162.
M. Guignard and K. Spielberg, “A direct dual method for the mixed plant location problem with some side constraints,”Mathematical Programming 17 (1979) 198–228.
S.K. Jacobsen, “Heuristics for the capacitated plant location problem,”European Journal of Operational Research 12 (1983) 253–261.
E.L. Johnson, M.M. Kostreva and U.H. Suhl, “Solving 0–1 integer programming problems arising from large scale planning models,”Operations Research 33 (1985) 803–820.
J. Krarup and P.M. Pruzan, “The simple plant location problem: Survey and synthesis,”European Journal of Operational Research 12 (1983) 36–81.
G. Laporte, H. Mercure and Y. Nobert, “Cutting planes based on bin packing solutions for the capacitated vehicle routing problem,” G-86-10, École des Hautes Études Commerciales (Montreal, Canada, 1986).
J.M.Y. Leung, “Polyhedral structure of capacitated fixed charge problems and a problem in delivery route planning,” Ph.D. thesis, Operations Research Center, MIT (Cambridge, MA, 1985).
J.M.Y. Leung, T.L. Magnanti and R. Vachani, “Facets and algorithms for capacitated lot sizing,”Mathematical Programming 45 (1989) 331–359.
T.L. Magnanti and R.T. Wong, “Decomposition methods for facility location problems,” in: R.L. Francis and P. Mirchandani, eds.,Discrete Location Theory (Wiley, New York, 1989).
K. Martin and L. Schrage, “Subset coefficient reduction cuts for 0/1 mixed integer programming,”Operations Research 33 (1985) 505–526.
G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence system polyhedra,”Mathematical Programming 6 (1974) 48–61.
M.W. Padberg, “On the facial structure of set packing problems,”Mathematical Programming 5 (1973) 199–215.
M.W. Padberg and S. Hong, “On the symmetric travelling salesman problem: A computational study,”Mathematical Programming Study 12 (1980) 78–107.
M.W. Padberg, T.J. Van Roy and L.A. Wolsey, “Valid linear inequalities for fixed charge problems,”Operations Research 33 (1985) 842–861.
G.T. Ross and R.M. Soland, “Modelling facility location problems as generalized assignment problems,”Management Science 24 (1977) 345–357.
A.S. Tanenbaum,Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 1981).
L.E. Trotter, Jr., “A class of facet producing graphs for vertex packing polyhedra,”Discrete Mathematics 12 (1975) 373–388.
T.J. Van Roy, “A cross decomposition algorithm for capacitated facility location,”Operations Research 34 (1986) 145–163.
T.J. Van Roy and D. Erlenkotter, “A dual-based procedure for dynamic facility location,”Management Science 28 (1982) 1091–1105.
T.J. Van Roy and L.A. Wolsey, “Valid inequalities and separation for uncapacitated fixed charge networks,”Operations Research Letters 4 (1985) 105–112.
T.J. Van Roy and L.A. Wolsey, “Valid inequalities for mixed zero–one programs,”Discrete Applied Mathematics 14 (1986) 199–213.
R.T. Wong, “Location and network design,” in: M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (Wiley, New York, 1985) pp. 127–147.
Author information
Authors and Affiliations
Additional information
This research was partially supported by Grant # ECS-8316224 from the National Science Foundation's Program in Systems Theory and Operations Research.
Rights and permissions
About this article
Cite this article
Leung, J.M.Y., Magnanti, T.L. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming 44, 271–291 (1989). https://doi.org/10.1007/BF01587093
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01587093