baumol-wolfe 模型（Baumol Wolfe 模型）.docVIP

baumol-wolfe 模型（Baumol Wolfe 模型） 1 、 statically determinate location problem Since the middle of 1860s, more and more researches have been done on the location problem, and the input conditions of many problems are determined values. Some studies establish a satisfactory facility location by setting up a multi-objective programming model [16]. There are two kinds of location problem based problems, many studies are set different conditions for further expansion in the two kinds of problems on the basis of this, two basic problems are: median problem; coverage problem, first studies the two kinds of problems are static and deterministic location problem. (1) median problem (median, problem) Hakimi[12]s first facility location problem independent of the application domain is the P- median problem. This method can be used to find P facility locations, minimizing the minimum transportation distance between demand points and facilities. The mathematical model of this problem can be referenced to the pages fortieth to 41 of the literature [17], and will not be repeated here. This model can be selected location in the limited candidate points. In the above model, the candidate points in the network nodes. Researchers have studied dots located on the edge of the network, Hakimi[12] on this problem have proved that the selected P facility location in the network, the P- network in the median problem, vertices of at least one optimal solution. In this way, can be located on the edge of the network location problems are simplified into dots only located at the vertices of the network problems, optimality does not affect the results and the target value of this simplified. The P- median problem is classified as a NP-complete problem. The candidate points defined in the network can greatly simplify the problem of vertex. Formula 2.1 represents the computational complexity of the simplified P- mean problem (2.1) The N represents the number of nodes in the network, and P represent