Solve linear programing problem using big m method


Discuss the below:

Q: Solve the following linear programing problem using "Big M method"

Minimize

Z=3X1+2X2 + 4X3

Subject To

X2+X3 >=10

2X1+X2+X3 <=60

2X1+3X2 +5X3=30

X1, X2, X3 >=0

Request for Solution File

Ask an Expert for Answer!!
Operation Research: Solve linear programing problem using big m method
Reference No:- TGS02062019

Expected delivery within 24 Hours