Creates the integer program associated with the CLSCP problem — OptiCLSCPWalkingTimeMPS • CHWplacement

This function executes the CLSCP problem to find optimal locations (Current & Storbeck) using the lpsolveAPI package for integer programming.

OptiCLSCPWalkingTimeMPS(
  pop.map,
  access.raster,
  radius,
  T.GC,
  popurb = "none",
  max.treat.per.CHW.urban,
  max.treat.per.CHW.rural,
  max.CHW.per.pixel = 1,
  directory,
  name
)

Arguments

pop.map: raster map containing population densities
access.raster: raster containing access to HF variable
radius: dimension of the radius around the point (same dimension as T.GC, e.g minutes)
T.GC: transition matrix T.CG associated to the map pop.map
popurb: raster map containing the urban population layer
max.treat.per.CHW.urban: max number of people per CHW in urban areas
max.treat.per.CHW.rural: max number of people per CHW in rural areas
max.CHW.per.pixel: maximum number of CHW that can be placed on the same pixel
directory: directory where to store the MPS file
name: name of the MPS file

Value

a MPS file containing the optimisation program