Minimize the objective function 150x + 50y where x is the number of packages ordered from Jungle and y is the numer of packages ordered from OHagan
And each package ordered from both companies supplies 5 mystery novels......and we must have at least 2500 of these....so, the constraint becomes :
5x + 5y >= 2500 → x + y >= 500
And each package from Jungle supplies 10 romance novels and each package from OHagan supplies 5 romance novels.....and we need at least 3500 of these....so we have
10x + 5y >= 3500 → 2x + y >= 700
Further....at least 75% of the the packages must come from OHagan....in other words, out of every 4 ordered, at least 3 must come from OHagan......put another way, we have
3x <= y
Look at the following graph : https://www.desmos.com/calculator/6hdrqjgy2o
Since mins and maxes occur only at the corner point of a feasible region, the only point that "works" here occurs at (140, 420)..........
Thus......... 150(140) + 50(420) = $42000 is the minimum cost by ordering 140 packages from Jungle and 420 packages from OHagan....
