Content deleted Content added
m added covering-packing info box |
m →LP Formulation: +. |
||
Line 8:
: minimize <math>\mathbf{c}^T \mathbf{x}</math>
: subject to <math>A \mathbf{x}\geq \mathbf{b}, \mathbf{x}\in\{0,1\}.</math>
The <math>i</math>th entry of the vector <math>\mathbf{x}</math> tells us, whether we take object <math>i</math> into our cover or not. The constraints <math>A\mathbf{x}\geq \mathbf{b}</math> tell us, what it means for <math>\mathbf{x}</math> to cover all object. Finally the cost function <math>\mathbf{c}</math> defines what we consider to be a 'cheap' cover.
| |||