Question

In: Operations Management

Consider the following problem     Maximize Z=2x1 + 5x2 subject to                4x1+ 2x2 ≤ 6...

Consider the following problem

    Maximize Z=2x1 + 5x2

subject to

               4x1+ 2x2 ≤ 6

                x1 + x2 ≥ 2

                xi ≥0 for i=1,2

  1. Inserting slack, excess, or artificial variables, construct the initial simplex tableau.
  2. Identify the corresponding initial (artificial) basic feasible solution including the objective function value.
  3. Identify the entering basic variable and the leaving basic variable for the next iteration.

Solutions

Expert Solution

Maximize Objective function Z=2x1 + 5x2

subject to constraints:

               4x1+ 2x2 ≤ 6

                x1 + x2 ≥ 2

                xi ≥0 for i=1,2

I have converted this problem to canonical form, here, I have added slack, surplus and artificial variables as needed

slack variable X3 is added as As the constraint 1 includes sign '≤'

surplus variable X4 and artificial variable X5 are added as constraint 2 includes sign '≥'

First tableau of Phase I

leaving variable is P3

entering variable is P1

Intermediate operations

Pivot row (Row 1):
6 / 4 = 1.5
4 / 4 = 1
2 / 4 = 0.5
1 / 4 = 0.25
0 / 4 = 0
0 / 4 = 0

Row 2:
2 - (1 * 1.5) = 0.5
1 - (1 * 1) = 0
1 - (1 * 0.5) = 0.5
0 - (1 * 0.25) = -0.25
-1 - (1 * 0) = -1
1 - (1 * 0) = 1

Row Z:
-2 - (-1 * 1.5) = -0.5
-1 - (-1 * 1) = 0
-1 - (-1 * 0.5) = -0.5
0 - (-1 * 0.25) = 0.25
1 - (-1 * 0) = 1
0 - (-1 * 0) = 0

Leaving variable is P5
Entering variable is P2

Intermediate calculations

Pivot row (Row 2):
0.5 / 0.5 = 1
0 / 0.5 = 0
0.5 / 0.5 = 1
-0.25 / 0.5 = -0.5
-1 / 0.5 = -2
1 / 0.5 = 2

Row 1:
1.5 - (0.5 * 1) = 1
1 - (0.5 * 0) = 1
0.5 - (0.5 * 1) = 0
0.25 - (0.5 * -0.5) = 0.5
0 - (0.5 * -2) = 1
0 - (0.5 * 2) = -1

Row Z:
-0.5 - (-0.5 * 1) = 0
0 - (-0.5 * 0) = 0
-0.5 - (-0.5 * 1) = 0
0.25 - (-0.5 * -0.5) = 0
1 - (-0.5 * -2) = 0
0 - (-0.5 * 2) = 1

Phase II

Intermediate calculations

Remove the columns corresponding to artificial variables.

Modify the row of the objective function for the original problem.

Calculate the Z line:
-(0) + (2 * 1) + (5 * 1) = 7
-(2) + (2 * 1) + (5 * 0) = 0
-(5) + (2 * 0) + (5 * 1) = 0
-(0) + (2 * 0.5) + (5 * -0.5) = -1.5
-(0) + (2 * 1) + (5 * -2) = -8

Leaving variable is P1
Entering variable is P4

Intermediate calculations

Pivot row (Row 1):
1 / 1 = 1
1 / 1 = 1
0 / 1 = 0
0.5 / 1 = 0.5
1 / 1 = 1

Row 2:
1 - (-2 * 1) = 3
0 - (-2 * 1) = 2
1 - (-2 * 0) = 1
-0.5 - (-2 * 0.5) = 0.5
-2 - (-2 * 1) = 0

Row Z:
7 - (-8 * 1) = 15
0 - (-8 * 1) = 8
0 - (-8 * 0) = 0
-1.5 - (-8 * 0.5) = 2.5
-8 - (-8 * 1) = 0

Optimal solution Objective Function Z = 15
X1 = 0
X2 = 3


Related Solutions

Consider the following problem     Maximize Z=2x1 + 5x2 + x3 subject to                4x1+ 2x2...
Consider the following problem     Maximize Z=2x1 + 5x2 + x3 subject to                4x1+ 2x2 + x3 ≤ 6                 x1 + x2 ≤ 2                 xi ³ 0 for i=1,2,3 a. Inserting slack variables, construct the initial simplex tableau. What is the initial basic feasible solution? b. What is the next non-basic variable to enter the basis c. Using the minimum ratio rule, identify the basic variable to leave the basis. d. Using elementary row operations, find the...
     Consider the following problem     Maximize Z=2x1 + 5x2 + x3 subject to                4x1+...
     Consider the following problem     Maximize Z=2x1 + 5x2 + x3 subject to                4x1+ 2x2 + x3 ≤ 6                 x1 + x2 ≤ 2                 xi ≥ 0 for i=1,2,3 a. Inserting slack variables, construct the initial simplex tableau. What is the initial basic feasible solution? b. What is the next non-basic variable to enter the basis c. Using the minimum ratio rule, identify the basic variable to leave the basis. d. Using elementary row operations, find...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   Answer ≤ C1/C2  ≤  Answer b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...
Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function?   .......... ≤ C1/C2  ≤  ............ b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...
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 ??
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 =...
Consider the following linear program. Maximize z= 5x1+ 3x2 subject to 3x1+ 5x2≤15 5x1+ 2x2≤10 –...
Consider the following linear program. Maximize z= 5x1+ 3x2 subject to 3x1+ 5x2≤15 5x1+ 2x2≤10 – x1+ x2≤2 x2≤2.5 x1≥0, x2≥0 a. Show the equality form of the model. b. Sketch the graph of the feasible region and identify the extreme point solutions. From this representation find the optimal solution. c. Analytically determine all solutions that derive from the intersection of two constraints or nonnegativity restrictions. Identify whether or not these solutions are feasible, and indicate the corresponding objective function...
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
Consider the following model: maximize 40x1 +50x2 subject to: x1 +2x2 ≤ 40 4x1 +3x2 ≤...
Consider the following model: maximize 40x1 +50x2 subject to: x1 +2x2 ≤ 40 4x1 +3x2 ≤ 120 x1, x2 ≥ 0 The optimal solution, determined by the two binding constraints, is x1 = 24, x2 = 8, OFV∗ = 1,360. Now consider a more general objective function, c1x1 + c2x2. Perform a sensitivity analysis to determine when the current solution remains optimal in the following cases: (i) both c1 and c2 may vary; (ii) c2 = 50, c1 may vary;...
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...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT