Let's now have a look at another problem. And we see how we can exploit a network flow model for this particular problem. So we have both the combinatorial version (through network flows) and another version by linear programming. Let's have first the max flow approach.
This is the definition of the problem. There are looms and articles to be woven. Not all articles can be woven by all looms. This table identifies which looms can weave a certain article. We know the quantity to be woven for each article.