Pioneer Foods makes various types of Trail mixes. Currently, it is looking at three products $-$ TM $1,$ TM $2,$ and

TM $3.$ These three require different proportions of nuts and raisins. The table below gives the requirement in a

$10oz$ packet for each and the amounts available. The profit form TM $1$ is $$0\mathrm{.}25,$ from TM $2$ is $$0\mathrm{.}36,$ and from

TM $3$ is $$0\mathrm{.}21.$ Formulate this as an integer linear programming problem in Box $1,$ solve using Solver in Box $2,$

and write the optimal solution in Box $3.$

Pioneer has a contract with a Neco Gym and must supply at least $200$ packets of TM $2.$ It also doesn't want to

produce more than $1000$ packets of TM $1$ as the demand is limited$.$

Solver setup here