Empty Feasible Region

Maximize z = 8x-3y
Subject







Unbounded feasible region
A produce grower is purchasing fertilizer containing 3machijhnes A, B
and C.
The minimum needs are 160 units of A, 200 units of B and 80 units of
C. There are two popular brands of fertilizer on the market. Fast Grow
costing $8 per bag contains 3 units of A, 5 units of B and 1 unit of C.
Easy Grow costing $6 per bag contains 2 units of A, 2 units of B and 2
units of C. If the grower wishes to minimize cost while still maintaining
the nutrients required, how many of bags of each brand should be
bought?
Let x = No. of bags of Fast Grow
Y = No of bags of Easy Grow.
The LP model is
Minimize Cost = 8x + 6y
Subject to






Locating the feasible region graphically.
> cnsts := [3*x+2*y>=160,5*x+2*y>=200, x+2*y>=80, x>= 0, y >=
0];
>
> p1 := inequal(cnsts, x = 0 .. 100, y = 0 .. 100,
optionsexcluded = (colour = white), optionsfeasible = (colour =
yellow)):display(p1);
>


Min cost is at x = 40 and y = 20.
Cost = 8x+6y = $440

Corner Point Method:
Corner Point C=8x+6y
(80,0) 640
(40,20) 440
(20,50) 460
(0,100) 600

So min cost is 440 at x = 40 and y = 20

Option 2: Sketcht he isocost line 8x+6y=480
Let x = 0, y = 80, Let y = 0, x=60
Draw this line and locate the minimum point.