Question

In: Operations Management

Max Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2     ≤ 8 2x2...

Max Z = 2x1 + 8x2 + 4x3

subject to

2x1 + 3x2     ≤ 8

2x2 + 5x3     ≤ 12

3x1 + x2 + 4x3         ≤15

and x1,x2,x3≥0;

Indicate clearly the optimal basic and nonbasic variables and their values and write the reduced cost of each optimal nonbasic variable.

Solutions

Expert Solution

step 1- convert above inequality into an equation by adding slag variable( less than equal is given)

step-2 construct the table corresponding to a basic solution

  • Cb= coefficient of a basic variable in the objective function
  • Cj= contribution of variables in objective function
  • B=basic variable
  • optimality condition all Cj-Zj<=0
  • MPR= minimum positive ratio( b(column)/ key column)

INTERPRETATION-

NON BASIC VARIABLE- variable(X1,X2,X3) that we put =0 for solving basic variable(S1, S2, , S3) , values of non basic variable are-

x1=0 i.e it is not produced

x2= 8/3

x3= 4/3

maxz= 2*0+8*(8/3)+4*(4/3)

= (64/3)+ (16/3)

= 80/3

as it is optimal so it cant increase to (80/3)

NOTE- IF YOU BLIKE MY ANSWER GIVE ME THUMBS UP, IT KEEPS MOTIVATING ME, THANX


Related Solutions

MAX Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 <= 8 2x2...
MAX Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 <= 8 2x2 + 5x3 <= 12 3x1 + x2 + 4x3 <= 15 x1 + x3 = 11 and x1,x2,x3 >= 0 apply the Dual Simplex Method to recover feasibility.
MAX Z = 2x1 + 8x2 + 4x3 + 9x4 subject to 2x1 + 3x2 +...
MAX Z = 2x1 + 8x2 + 4x3 + 9x4 subject to 2x1 + 3x2 + 2x4 <= 8 2x2 + 5x3 + x4 <= 12 3x1 + x2 + 4x3 + 2x4 <= 15 and x1,x2,x3,x4 >= 0 apply the Primal Simplex Method to recover optimality.
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 =...
Maximize $4X1 + $8X2 Subject To 2X1 + 5X2 ≤ 50 3X1 + 3X2 ≤ 48...
Maximize $4X1 + $8X2 Subject To 2X1 + 5X2 ≤ 50 3X1 + 3X2 ≤ 48 X1, X2 ≥ 0 what the optimal ??
"Primal" MAXIMIZE Z = 12X1 + 18X2 +10X3 S.T. 2X1 + 3X2 + 4X3 <= 50...
"Primal" MAXIMIZE Z = 12X1 + 18X2 +10X3 S.T. 2X1 + 3X2 + 4X3 <= 50 -X1 + X2 + X3 <= 0 0X1 - X2 + 1.5X3 <= 0 X1, X2, X3 >=0 1. Write the "Dual" of this problem. 2. Write the "Dual of the Dual" of this problem. For steps 3 & 4, use the Generic Linear Programming spreadsheet or the software of your choice. (Submit a file pdf, text, xls file, etc., indicating the solution values...
"Primal" MAXIMIZE Z = 12X1 + 18X2 +10X3 S.T. 2X1 + 3X2 + 4X3 <= 50...
"Primal" MAXIMIZE Z = 12X1 + 18X2 +10X3 S.T. 2X1 + 3X2 + 4X3 <= 50 -X1 + X2 + X3 <= 0 0X1 - X2 + 1.5X3 <= 0 X1, X2, X3 >=0 1) a) Write the "Dual" of this problem. b) Write the "Dual of the Dual" of this problem. For steps C & D, use the Generic Linear Programming spreadsheet or the software of your choice. (indicating the solution values and objective function value.) c) Solve the...
Consider the following linear programming problem: Max Z =          3x1 + 3x2 Subject to:      ...
Consider the following linear programming problem: Max Z =          3x1 + 3x2 Subject to:       10x1 + 4x2 ≤ 60                   25x1 + 50x2 ≤ 200                   x1, x2 ≥ 0 Find the optimal profit and the values of x1 and x2 at the optimal solution.
Exercise Solve the following linear programs graphically. Maximize            Z = X1 + 2X2 Subject to            2X1...
Exercise Solve the following linear programs graphically. Maximize            Z = X1 + 2X2 Subject to            2X1 + X2 ≥ 12                             X1 + X2 ≥ 5                            -X1 + 3X2 ≤ 3                            6X1 – X2 ≥ 12                            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
Find the solution to the following problem MAXZ=2x1 +20x2 –10x3 subject to 2x1 +20x2 +4x3 ≤15...
Find the solution to the following problem MAXZ=2x1 +20x2 –10x3 subject to 2x1 +20x2 +4x3 ≤15 6x1 +15x2 +6x3 ≤20 5x1 +3x3 ≤13 and x1, x2, x3 ≥ 0 x1, x2, x3 = integer
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT