A strong formulation for the plant location problem

Conference · Sat Dec 31 04:00:00 EST 1994

OSTI ID:35945

DeSimone, C; Sassano, A; Mannino, C

The plant location problem is to choose the location of plants in order to maximize the profit of satisfying the demand for some commodity. There are fixed costs for every plant that is chosen and for transporting the commodities between the plants and the clients. We assume that there are no constraints on the capacities of the plants (simple plant location problem). To each instance of this problem, one can associate a digraph in which nodes correspond to the plants and to the clients and each arc (i, j) corresponds to the route from plant i to client j. This problem can be formulated as an integer linear program in which the variables are constrained to assume 0-1 values. We show how to transform the simple plant location problem corresponding to a given digraph D = (N, A) into the problem of finding a stable set of maximum weight in an undirected graph G = (V, E) with V = A and E = {l_brace} uv : u = (i, j), v = (h, k), j = h or j = k{r_brace}. We give a characterization of the class C of all graphs that arise this way. Moreover, we show that the strong perfect graph conjecture holds for all graphs in C. This allows us to show that there exists a polynomial time algorithm to solve all the instances of the simple plant location problem whose corresponding directed graphs yield perfect (undirected) graphs.

• OSTI ID: 35945
• Report Number(s): CONF-9408161--
• Country of Publication: United States
• Language: English

Related Subjects

29 ENERGY PLANNING, POLICY, AND ECONOMY
99 GENERAL AND MISCELLANEOUS
COMPUTERIZED SIMULATION
INDUSTRIAL PLANTS
OPTIMIZATION
PARAMETRIC ANALYSIS
SITE SELECTION