Reconsider Prob. 4.3-6. Now use the given information and the theory of the simplex method to identify a system of three constraint boundary equations (in x1, x2, x3) whose simultaneous solution must be the optimal solution, without applying the simplex method. Solve this system of equations to find the optimal solution.
Answer to relevant QuestionsConsider the following problem. Maximize Z = 2x1 + 2x2 + 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Consider the three-variable linear programming problem shown in Fig. 5.2. (a) Construct a table like Table 5.4, giving the indicating variable for each constraint boundary equation and original constraint. Work through the matrix form of the simplex method step by step to solve the model given in Prob. 4.1-5. For iteration 2 of the example in Sec. 5.3, the following expression was shown: Derive this expression by combining the algebraic operations (in matrix form) for iterations 1 and 2 that affect row 0. Work through the revised simplex method step by step to solve the model given in Prob. 3.1-6.
Post your question