OptiCLSCPWalkingTimeMPS: Creates the integer program associated with the CLSCP problem

In SwissTPH/CHWplacement: What the Package Does (One Line, Title Case)

Creates the integer program associated with the CLSCP problem

Description

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

Usage

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

SwissTPH/CHWplacement documentation built on March 10, 2023, 2:34 p.m.