turfLP - TURF Analysis with Integer Linear Programming
Finds product portfolios that maximize TURF (total
unduplicated reach and frequency) with integer linear
programming, following Serra (2013)
<doi:10.1016/j.foodqual.2012.10.001>. The maximum reach problem
is the maximal covering location problem of Church and ReVelle
(1974) <doi:10.1007/BF01942293>. The package solves it as an
integer linear program, so it finds exact optima without
enumerating every portfolio. Ties on reach are broken by
frequency and then by the harmonic mean of the individual
product reaches. The package also finds the smallest portfolio
that reaches every reachable respondent. For related work on
TURF for large data sets, see Ennis, Fayle, and Ennis (2012)
<doi:10.1016/j.foodqual.2011.06.004>.
