Scribd
Upload
3 views

Maximization using simplex

The document outlines a linear programming problem aimed at maximizing profit and minimizing costs through the use of a tableau method. The optimal solutions found are to produce 40 units of Product A and 20 units of Product B for a maximum profit of $200, and to produce 60 units of Product P1 and 40 units of Product P2 for a minimum cost of $440. The steps include identifying pivot columns and rows, performing pivot operations, and checking for optimality.

Uploaded by

Aklilu Anmut
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

Maximization using simplex

The document outlines a linear programming problem aimed at maximizing profit and minimizing costs through the use of a tableau method. The optimal solutions found are to produce 40 units of Product A and 20 units of Product B for a maximum profit of $200, and to produce 60 units of Product P1 and 40 units of Product P2 for a minimum cost of $440. The steps include identifying pivot columns and rows, performing pivot operations, and checking for optimality.

Uploaded by

Aklilu Anmut
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Example

Max Z=3x+2y+0S1+0S2+0S3

Subject to:

2X+y+S1=18

2X+3Y+S2=42

3X+Y+S3=24

X,Y,S1,S2,S3≥0

Solution
x = 3 and y = 12

1
Step 8 : Identify the Pivot Column
The pivot column is the one with the most negative coefficient in the last row (objective function row). Here,
it is the x column (-1).
Step 9: Identify the Pivot Row
To find the pivot row, we calculate the ratios of the right-hand side (solution) to the corresponding positive
entries in the pivot column.
1.For
2.For y:

Step 10: Perform the Pivot Operation


Pivot Element: 1.5 (from ​)
Row Operations:
1.Row 1 (new ​):
2.Row
3.Row 2:
4.Row )
5.Row 4 (Objective Row):
6.Row 4+Row1

Step 11: Check for Optimality


In the new tableau, there are no negative coefficients in the objective row. Thus, we have reached the optimal
solution.
Step 12: Read the Solution
The values of the basic variables are:
•x=40
•y=20
Profit Calculation
The maximum profit is:

Conclusion
To maximize profit, the factory should produce 40 units of Product A and 20 units of Product B,
resulting in a maximum profit of $200.
Step 8: Identify the Pivot Column
The pivot column is the one with the most negative coefficient in the last row (objective function row). Here, it is
the x column (-4).
Step 9: Identify the Pivot Row
To find the pivot row, we calculate the ratios of the right-hand side (solution) to the corresponding positive entries
in the pivot column.
1.For : because
2.The smallest ratio is 60, so the pivot row is the row for ​.
Step 11: Perform the Pivot Operation
Pivot Element: 1 (from ​)
Row Operations:
1.Row 1 (new ​):
2.Row 2÷1⇒(1,0,1,-1,60)
3.Row 4 (Objective Row):
4.Row 4+4×Row 2⇒
Step 12: Check for Optimality
In the new tableau, there are no negative coefficients in the objective row. Thus, we have reached the optimal
solution.
Step 13: Read the Solution
The values of the basic variables are:
•x=60
•y=40
Cost Calculation
The minimum total production cost is:

Conclusion
To minimize costs, the company should produce 60 units of Product P1 and 40 units of Product P2, resulting in a
minimum total cost of $440.

You might also like