chapter  10
Linear Programming and Applications in Examining Wasteful Commuting and Allocating Health Care Providers
Pages 30

Section 10.3 introduces integer linear programming (ILP), in which some of the decision variables in a linear programming problem take on only integer values. Some classic location-allocation problems, such as the


-median problem, the location set covering problem (LSCP), and the maximum covering location problem (MCLP), are used to illustrate the formulation of ILP problems. Applications of these location-allocation problems can be widely seen in both private and public sectors. Section 10.4 uses a hypothetical example of allocating health care providers in Cuyahoga County, Ohio, to illustrate the implementation of a location-allocation problem in ArcGIS. The chapter is concluded in Section 10.5 with a brief summary.