Let the quantity of set A be represented by a units and the quantity of set B be represented by b units. From the question we have that the following constraints hold
a≥0b≥02a+b≥7a+2b≥5a+3b≥11
Since we need to minimize the cost. Hence we have function
minz=180a+300b
Combining all constraints we have that
minz=180a+300b subject to the following constraints
a≥0b≥02a+b≥7a+2b≥5a+3b≥11
Using corner method in the graph below
we have that the corner points are
(0,7),(2,3),(11,0)
Hence we input each corner point into our cost minimization function
minz=180a+300b
Since (2,3) has the least cost, therefore we need 2 sets of food A and 3 sets of food B
Comments