The solution too long, so i wrote it down in my word and pasted it here, You may download the image and view it s it will be clearly visible. Thank you!
4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54 x1 + x2 = 3 and X120, X2 0. DI (a) Solve this problem graphically. (b) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable. I (c) Continue from part (b) to work through the simplex method step...
2. Solve the LPP by the dual simplex method Minimize: z = 3x1 + 2x2 Subject to:: x1 + x2 > 1 4x1 + x2 > 2 -X1 + 2x2 < 6 Xi > 0, i=1,2
Problem 3. Solve the following LP by the simplex method. max -x1 + x2 + 2xz s. t x1 + 2x2 – x3 = 20 -2x1 + 4x2 + 2x3 = 60 2xy + 3x2 + x3 = 50 X1, X2, X3 > 0 You can start from any extreme point (or BFS) that you like. Indicate the initial extreme point (or BFS) at which you start in the beginning of your answer. (30 points)
MAX 100X1 + 120X2 + 150X3 + 125X4 Subject to X1 + 2X2 + 2X3 + 2X4 s 108 X1 + 5X2 + X4 s 120 X1 + X3 = 25 X2 + X3 + X4 2 50 X1, X2, X3, X420 Using the simplex method, provide the solution
Consider the following linear programming model Max 2X1 + 3X2 Subject to: X1 + X2 X1 ≥ 2 X1, X2 ≥ 0 This linear programming model has: A. Infeasible solution B. Unique solution C. Unbounded Solution D. Alternate optimal solution E. Redundant constraints
Determine the Dual of the following Linear Programming Problems Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6 Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6
(1 point) Use the simplex method to maximize P = 2x1 + 3x2 + x3 subject to -X -X1 + X2 + 4x2 + 2x2 + 10x35 10 + 6x3 9 + 10x3 S 11 X X120 x220 x3 20 P=
Min Z = 6X1 + 4x2 Subject to Xi + 2x2 > 2 -X1 + 2x2 5 4 3x1 + 2x2 < 12 X1, X2 > 0
10. What is the dual of the following problem: Minimize x1 + x2, subject to xi 20, x2 > 0, 2xı > 4, x1 + 3x2 > 11? Find the solution to both this problem and its dual, and verify that minimum equals maximum.
Find solution using Simplex method (BigM method) MAX Z = 5x1 + 3x2 + 2x3 + 4x4 subject to 5x1 + x2 + x3 + 8x4 = 10 2x1 + 4x2 + 3x3 + 2x4 = 10 X j > 0, j=1,2,3,4 a) make the necessary row reductions to have the tableau ready for iteration 0. On this tableau identify the corresponding initial (artificial) basic feasible solution. b) Following the result obtained in (a) solve by the Simplex method, using...