Scribd
Upload
71 views2 pages

Management Science Activity

The document describes using the simplex method to solve a linear programming problem to maximize profit given constraints. It provides the mathematical model, sets up the initial tableau with slack variables, and walks through the simplex method steps of pivoting and updating the tableau until reaching the optimal solution. The optimal solution is found to be 3 units of X1 and 6 units of X2, with maximum profit of $48.

Uploaded by

Earl Hyannis Elauria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
71 views2 pages

Management Science Activity

The document describes using the simplex method to solve a linear programming problem to maximize profit given constraints. It provides the mathematical model, sets up the initial tableau with slack variables, and walks through the simplex method steps of pivoting and updating the tableau until reaching the optimal solution. The optimal solution is found to be 3 units of X1 and 6 units of X2, with maximum profit of $48.

Uploaded by

Earl Hyannis Elauria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Management Science

I. Learning Outcomes
At the end of the activity, you will be able to:
a. convert the new program with correct slack variables;
b. set up the initial table correctly;
c. compute the value of Zj, Cj – Zj correctly;
d. make decision on the values of the optimum solution.

II. Enhancement Activity

Find the value of the unknown variables and the maximum profit
using the simplex method.
Maximize Z: 6x1 + 5x2
Subject to: 1) 2x1 + x2 = 12
2) 2x1 + 3x2 ≤ 24
3) 2x1 + 9x2 ≥ 36
III. Procedures
1. Set up the new programs with slack variables.
2. Make the initial table and enter the needed data.
3. Compute the Zj values.
4. Compute the Cj – Zj values.
5. Identify the optimum column.
6. Determine the pivotal row.
7. Construct the table II with the replacing row.
8. Complete the table entries indicating the optimum
solution and pivotal row.
9. Construct table III replacing row and complete the
entries by providing the necessary data to complete
the table.
10.Continue the process until you reach the optimum
table/solution.
11.Make a decision from the optimum table.
The new program with slack variable will be:
Maximize Z: 6x1 + 5x2 + 0s1 + 0s2 + 0s3
Subject to: 1) 2x1 + x2 + s1 = 12
2) 2x1 + 3x2 + s2 = 24
3) -2x1 - 9x2 + s3 = -36

Table 1
Cj 6 5 0 0 0
Prod Qty X1 X2 S1 S2 S3
0 S1 12 2 1 1 0 0
0 S2 24 2 3 0 1 0
0 S3 -36 -2 -9 0 0 1
Zj 0 0 0 0 0 0
Cj - Zj 6 5 0 0 0

Table 2
Cj 6 5 0 0 0
Prod Qty X1 X2 S1 S2 S3
6 X1 6 1 ½ ½ 0 0
0 S2 12 0 2 -1 1 0
0 S3 -24 0 -8 1 0 1
Zj 36 6 3 3 0 0
Cj - Zj 0 2 -3 0 0

Table 3
Cj 6 5 0 0 0
Prod Qty X1 X2 S1 S2 S3
6 X1 3 1 0 3/4 -1/4 0
5 X2 6 0 1 -1/2 1/2 0
0 S3 24 0 0 -3 4 1
Zj 48 6 5 2 1 0
Cj - Zj 0 0 -2 -1 0

Decision: X1 = 3 units
X2 = 6 units
Max Z = P 48.00

You might also like