A Decomposition Algorithm for Public Central Facilities Location |
Contents
A Decomposition Algorithm for Public Central | 13 |
Extensions of the Decomposition Algorithm | 27 |
Computational Results | 31 |
1 other sections not shown
Common terms and phrases
ALGORITHM FOR PUBLIC approximate artificial variables artificial vectors associated with node basis inverse BjXj Central Facilities Location clinics closest open center computation convex combination convex set CORNELL UNIVERSITY LIBRARY corresponding cost of demolition coupling constraints current basis decision-maker Decomposition Algorithm dual variables associated extreme point solutions feasible solution fixed-charge problem gible global optimum heuristic i-th solution ineligible nodes infeasibility integer property j-th position j-th subproblem linear programming location methods Maranzana matrix Minimize n-component column vector n-component vector node ineligibility noise constraint number of centers objective function objective value obtained open facility operator optimal solution partitioning population at node problem 1.1 Public Central Facilities required nodes ReVelle 13 ReVelle formulation ReVelle's formulation simplex method solu solution is optimal solution VII solved specified Ten-Node Location Problem thesis tion total regional utility total shipping cost transportation cost user population user-distance user-miles travelled warehouse zero Σμ