Solve the following linear programming model graphically:
Max Z= 3x1 +4x2
Subject to: 2x1 + 4x2 <= 22
-x1 + 4x2 <= 10
4x1 – 2x2 <= 14 x1 – 3x2 <= 1
x1, x2, >=0
Clearly identify the feasible region, YOUR iso-profit line andthe optimal solution (that is, d.v. values and O.F. Value.
Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!
(Save $1 )
One time Pay
(Save $5 )
Billed Monthly
*First month only
You can see the logs in the Dashboard.
