\[{\mathit{Maximize} \space \sum_{i = 1}^{I} -s \space c_i \space x_i + \sum_{j = 1}^{J} a_j w_j \\}\]
- where \(c_i\) is the cost of cell \(i\)
- \(x_i\) is the decision to use (1) or not use (0) cell i in the final solution
- \(a_j\) is the amount of feature \(j\) in cell \(i\) and \(w_j\) is the weight of each feature
- \(s\) is a scaling factor used to shrink the costs so that the problem will return a cheapest solution
Subject to
\[\sum_{i = 1}^{I} x_i c_i \leq B\]
- Where B is a budget (don’t need to set fixed boudaries)