Content deleted Content added
No edit summary Tag: Disambiguation links added |
Erel Segal (talk | contribs) |
||
Line 8:
{{Covering-Packing_Problem_Pairs}}
==General linear programming formulation==
In the context of [[linear programming]], one can think of any minimization linear program as a covering problem if the coefficients in the constraint [[matrix (mathematics)|matrix]], the objective function, and right-hand side are nonnegative.<ref>{{Cite book | last=Vazirani | first=Vijay V. | author-link=Vijay Vazirani | title=Approximation Algorithms | year=2001 | publisher=Springer-Verlag | isbn=3-540-65367-8 }}{{rp|112}}
</ref> More precisely, consider the following general [[integer linear program]]:
{|
| |||