What knapsack covering inequality can be inferred from the metaconstraint (2.19)? Assume each xi ≥ 0. A farmer wishes to apply fertilizer to each of several plots. The additional crop yield from plot...

What knapsack covering inequality can be inferred from the metaconstraint (2.19)? Assume each xi ≥ 0.

A farmer wishes to apply fertilizer to each of several plots. The additional crop yield from plot i per unit of type k fertilizer applied is aik, and

the runoff into streams is cik. There are storage facilities on the farm for

at most K different kinds of fertilizer. Use variable indices and the nvalues

constraint to formulate the problem of identifying which fertilizer to apply

to each plot, and how much, to maximize total additional yield subject to an

upper limit U on the amount of runoff. Now, reformulate the problem using

indexed linear constraints in place of variable indices.