The Single Source Weber Problem — Survey and Extensions

Alfred Weber reduced the problem of locating a firm under the conditions that all cost elements other than those which vary regularly with space are held constant, to that of determining the point(s) of minimum transportation costs. This paper presents a survey of the techniques used to solve this problem and gives an efficient Quadratic Approximation Search Technique which was coded in FORTRAN IV and tested on a number of problems for it.