Problem 2 (based on Exercise 6-34 from the textbook). Consider the linear program min 2x1 + 3x2 + 4x3 s.t. X1 + 2x2 + x3

[answerhappygod]

Problem 2 Based On Exercise 6 34 From The Textbook Consider The Linear Program Min 2x1 3x2 4x3 S T X1 2x2 X3 1 (84.85 KiB) Viewed 27 times

Problem 2 (based on Exercise 6-34 from the textbook). Consider the linear program min 2x1 + 3x2 + 4x3 s.t. X1 + 2x2 + x3 > 3 221 – 22 + 3x3 > 4 X1, X2, X3 > 0 (a) Place the problem in standard form (6) State the dual of the problem (c) Choose the slack variables you added in part (a) as basic solutions, and compute the corresponding primal basic solution. Is it a basic feasible solution? (d) Show that vi = V2 = 0 is dual feasible (e) Starting from the primal basis of part (c) and the dual solution of part (d), apply one iteration of dual simplex. That is, compute an improving direction, a step size and the new primal and dual solution.