Maximize Z= 3 X1+4 X2+2.5X3 Subject to 3X1+4X2+2X3≤500 2X1+1X2+2X3≤400 1X1+3X2+3X3≤300 X1,X2,X3≥0 Change objective function coeffiecient x3...

Maximize Z= 3 X1+4 X2+2.5X3

Subject to

3X1+4X2+2X3≤500

2X1+1X2+2X3≤400

1X1+3X2+3X3≤300

X1,X2,X3≥0

Change objective function coeffiecient x3 to 6 and change coefficient of x3 to 5in constraint 1 ,to 2 in constraint 2 ,to 4 in constraint3. calculate new optimal solution using sensitivity analysis

Expert Solution

The solution is:

The sensitivity analysis is:

orchestra answered 2 years ago

4.Maximize: Z = 2X1+ X2-3X3 Subject to: 2X1+ X2= 14 X1+ X2+ X3≥6 X1, X2, X3≥0...

4.Maximize: Z = 2X1+ X2-3X3 Subject to: 2X1+ X2= 14 X1+ X2+ X3≥6 X1, X2, X3≥0 Solve the problem by using the M-technique.

maximize z = 2x1+3x2 subject to x1+3X2 6 3x1+2x2 6 &nb

maximize z = 2x1+3x2 subject to x1+3X2 6 3x1+2x2 6 x1,x2 This can be simply done by drawing all the lines in the x-y plane and looking at the corner points. Our points of interest are the corner points and we will check where we get the maximum value for our objective function by putting all the four corner points. (2,0), (0,2), (0,0), (6/7, 12/7) We get maximum at = (6/7, 12/7) and the maximum value is =...

Given the following primal problem: maximize z = 2x1 + 4x2 + 3x3 subject to x1...

Given the following primal problem: maximize z = 2x1 + 4x2 + 3x3 subject to x1 + 3x2 + 2x3 ≥ 20 x1 + 5x2 ≥ 10 x1 + 2x2 + x3 ≤ 18 x1 , x2 , x3 ≥ 0 1. Write this LP in standart form of LP. 2.Find the optimal solution to this problem by applying the Dual Simplex method for finding the initial basic feasible solution to the primal of this LP. Then, find the optimal...

Consider the following LP model.Max Z = 3x1 - 4x2 + x3 subject to x1 + x2 +...

Consider the following LP model.Max Z = 3x1 - 4x2 + x3 subject to x1 + x2 + x3 >= 9 2x1 + x2 + x3<= 12 x1 + x2 = 5 x1, x2, x3 >= 0 Change it to standard form. Obtain all the basic solutions and indicate which ones are basic feasible solutions and write down the corresponding corner points. For each basic solution, you have to obtain the values of all the variables. Obtain the solution of the LP...

Consider the problem maximize Z = 5 x1 + 3 x2 + 2 x3 + 4...

Consider the problem maximize Z = 5 x1 + 3 x2 + 2 x3 + 4 x4 subject to 5 x1 + x2 + x3 + 8 x4 = 10 2 x1 + 4 x2 + 3 x3 + 2 x4 = 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. Also, identify the initial entering and...

By using Big-m method Minimize z=4x1+8x2+3X3subject to x1+x2>=2, 2x1+x3>=5 and x1,x2,x3>=0

Find dual from primal conversion MIN Z = x1 - 2x2 subject to 4x1 - x2 >= 8 2x1 + x2 >= 10 -x1 + x2 <= 7 and x1,x2 >= 0

Find dual from primal conversion MIN Z = x1 - 2x2 subject to 4x1 - x2 >= 8 2x1 + x2 >= 10 -x1 + x2 = 0

Solve the following linear programming problem using generalised simplex method Maximise z= 2x1+3x2 subject to -2x1+x2>=3...

Solve the following linear programming problem using generalised simplex method Maximise z= 2x1+3x2 subject to -2x1+x2>=3 3x1+x2<=5 x1,x2>=0

Question