Question: Solve the following linear programming problem by Big M method Minimize z = 80x1 +62x2 +50x3 Subject to: 80x1 +20x2 +30x3 100 10x1 +50x2 +40x3
Solve the following linear programming problem by Big M method Minimize z = 80x1 +62x2 +50x3
Subject to:
80x1 +20x2 +30x3 100
10x1 +50x2 +40x3 200
20x1 +10x2 +50x3 120
x1, x2, x3 0 .
[COURSE: OPERATION RESEARCH]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
