Minimize f 2x1 3x2 x3 subject to x1 4x2 2x3 greater tha

Minimize f - 2x_1 + 3x_2 + x_3 subject to x_1 + 4x_2 + 2x_3 greater than or equal to 8 3x_1 + 2x_2 greater than or equal to 6 and x_1 greater than or equal to 0 x_2 greater than or equal to 0 x greater than or equal to 0 Reform this problem to fit our standard solution for linear programming model. Using Big - M method, work through simplex method step by step to solve problem. Using two Phrase method, work through simplex method step by step to solve problem. Compare sequence of BF solutions obtained in parts (b) and (C). Which of these solutions is feasible only for the artificial problem, obtained by introducing artificial variables and which are the actually feasible for the real problem? Use software package based on simple method to solve problem.

Solution

Please send again the questions but write in the page