Home /
Expert Answers /
Operations Management /
1-using-the-big-m-method-solve-the-lp-problem-begin-aligned-text-max-z-x-1-pa323
(Solved): 1- Using the Big \( M \) method, solve the LP problem \[ \begin{aligned} \text { Max. } Z=& x_{1}+ ...
1- Using the Big \( M \) method, solve the LP problem \[ \begin{aligned} \text { Max. } Z=& x_{1}+5 x_{2}+3 x_{3} \\ \text { s.t. } \quad & x_{1}+2 x_{2}+x_{3}=3 \\ & 2 x_{1}-x_{2}=4 \\ & x_{1}, x_{2}, x_{3} \geqslant 0 \end{aligned} \] a. Solve the program as given b. treat \( x_{3} \) as slack vaxiable, so only artificial raliable is needed for the znd constraint.
Expert Answer
Answer : As per the given information in the Above question... LP problem Max Z = X1+5X2+3X3 S.t. X1+2X2+X3 = 3 2X1-X2 = 4 X1+X2+X3 > 0