A Decomposition Algorithm for a Class of Facility Location Problems |
Contents
LOCATION AND GENERALIZED LAGRANGE MULTIPLIER METHODS | 19 |
ALTERATIONS TO THE DECOMPOSITION ALGORITHM | 49 |
A PARAMETRIC LOCATION ALGORITHM | 67 |
2 other sections not shown
Other editions - View all
Common terms and phrases
50 Node Example A-optimality adjacent optimal assignment basis inverse basis vectors Bellmore blem chapter Ckik closest open facility Code Optimization computational convex combination corresponding decomposition algorithm determining dual variables associated extremal problem facility location problems facility solution favorable vector feasible solution Figure given GLM code GLM formulation indicate integer optima integer programming integer solutions investment constraint Lagrange Multiplier Lagrange Multiplier Methods level of investment linear programming matrix method Minimize number of facilities number of feasible number of iterations objective function opti optimal solution p-median code p-median formulation p-median problem parametric algorithm partition possible private problem procedure Ralph Warner reduce the number required node Resolving Fractional Solutions Rojeski and ReVelle satisfy Section 4.3 SERVES USER NODE service facility shown solu solution to 2.11 solving specified Spielburg Table Theorem thesis tion travel distance user-distance Vector Selection Δλ