Exercise 4.1 Consider the linear programming problem: minimize 1 2 subject to 21 3x23A K 0...
Based on this linear programming problem below, and answer the following questions: Minimize subject to Z=500 y, + 200 y, 3y, + y 24 -y, +2y, 210 y; - y, 215 -y, +4y, 225 y, 20, y, 20 and 1) Find the dual to the linear programming problem. 2) Using the simplex method to solve the dual problem. 3) The simplex method in part 2) should require 3 pivots (4 tableaus including the initial one). For each tableau, write the...
Consider the following linear programming problem: Minimize 20X + 30Y Subject to: 2X + 4Y ≤ 800 6X + 3Y ≥ 300 X, Y ≥ 0 What is the optimum solution to this problem (X,Y)? A) (0,0) B) (50,0) C) (0,100) D) (400,0)
1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using the simplex algorithm gave the final tableau T4 T5 #210 1-1/4 3/8-1/812 0 0 23/4 3/8 7/8 10 (a) (3 points) Add the constraint -221 to the final tableau and use the dual simplex algorithm to find a new optimal solution. (b) (3 points) After adding the constraint of Part (a), what happens to the optimal solution if we add the fourth constraint 2+...
16.10 Consider the linear programming problem minimze -T subject to 1-2-1 T1,2 20 a. Write down the basic feasible solution for z as a basic variable. b. Compute the canonical augmented matrix corresponding to the basis in part a c. If we apply the simplex algorithm to this problem, under what circum stance does it terminate? (In other words, which stopping criterion in the simplex algorithm is satisfied?) d. Show that in this problem, the objective function can take arbitrarily...
Problem 3 Consider the LP problem Minimize -3r22 0s1+0s2 +0s3 0s Subject to 228 2r2 + $2 1,2,81,82 8384 with optimal tableau as follows: sic r1 T2 s1 s2 s3 s4 Solution C 0 0 20 1 0 0 12 Optimum 0 30 0-103 4 0 021 2 Find the dual optimal solution and the corresponding objective function value using the information provided in the optimal simplex tableau. Problem 3 Consider the LP problem Minimize -3r22 0s1+0s2 +0s3 0s Subject...
question e 3. For the following linear programming (primal) problem Minimize Z -3x1 x2 - 2x3, subject to xx2 2x3 s 20 2xl x2 - x3 < 10 and xl20, x220, x32 0. (a) Find a standard form of the given problem and solve the problem using simplex (b) Find marginal costs corresponding each constraint of the primal (c) If we change the right hand side of the first constraint (10) to 10+A, then draw a graph representing the optimal...
Q25. Solve the linear programming problem. Minimize z = 11x + 6y + 7 subject to: x 20, x +y21. 0, y a. minimum: 7 b. minimum: 18 c. minimum: 24 d. minimum: 13
Consider the following LP problem. minimize 3:01 +4.c3 subject to 2:01 + x3 - I3 < -2 21 +3.02 – 5x3 = 7 21 <0,22 > 0, 03 free Which of the LP problem below is its dual problem? maximize -2p1 + 7p2 subject to 2p. + P23 1 + 3p2 50 -P1 - 5p2 = 4 Vi < 0,2 > 0 maximize --2p1 + 702 subject to 2p. + P23 1 + 3p2 50 -P1 - 5p2 = 4...
Consider the following optimization problem: minimize 71 subject tox,- r, where r > 0 is a given scalar 1. Write down the FONC and SONC for this problem. (5 points) 2. Shw ihai whken f is vx, nxxssary conditions a: also sufiint. (10 poimis) Consider the following optimization problem: minimize 71 subject tox,- r, where r > 0 is a given scalar 1. Write down the FONC and SONC for this problem. (5 points) 2. Shw ihai whken f is...
Solve the linear programming problem by simplex method. . Minimize C= -x - 2y + z. subject to 2x + y +2 < 14 4x + 2y + 3z < 28 2x + 5y + 5z < 30 x = 0, y>02 > 0