Simplified Module in Management

Science

Module No.

Lesson No. 3
Standard Linear Programming Model:
Minimization Problem
3
Summer Class 2020
Angelita Mando

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Steps in Solving Standard LP Maximization Model Using Simplex

Method
Steps in solving minimization problem are similar to maximization except for these 3
processes:

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Summary of Converting Constraints to Equations in Minimization

Problem

1. Add an artificial variable (+A) if the symbol of the equation is =.

2. Add slack variable (+S) if the symbol of the equation is ≤ .
3. Subtract slack variable (-S) and add an artificial variable (+A) if the symbol is ≥ .

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Summary of Converting Constraints to Equations in Minimization

Problem

- Artificial Variable will save slack variable from becoming negative. It prevents an equality
constraint from equating to 0.
- In minimization problem Slack Variables do not contribute any amount to cost.
- Artificial Variables contribute the biggest amount or coefficient to cost. Coefficients of an
artificial variable should be multiples of 10 or in the power of 10 ( example: 10, 100, 1000,
etc.) greater than any of the coefficients involve in the objective function and constraints.
- If slack (S) is (-) do not enter it on solution variables, prioritize the artificial variable.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Problem

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Step 1 Construct the new program.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Step 1 Construct the new program.

1. We add the first slack ( S_1)on the first equation since the symbol of that equation is ≤ (less
than or equal to) to make the equation equal to 15.
2. Second slack ( S_2) (has been deducted and first artificial variable (A_(1) )has been added
to the second equation since the symbol of that equation is ≥ (greater than or equal to) to
make the equation equal to 16.
3. The Slack added on the 1st equation (S_1) and second slack deducted on the 2nd equation
were added to the objective function with 0 coefficient since slacks do not contribute any

The 1st artificial value 〖 (A 〗 _1) was also added to the objective function with 100 as the
amount to the cost.

coefficient since in the power of 10, 100 is greater than 60 (the greatest value among the
coefficient in the objective and constraints).

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Prepare the initial table, then follow the same steps as in the maximization
Step 2 process.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Determine the optimum column or entering variable by choosing the most
Step 3 negative values in the Cj - Zj row.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 ⮚ Steps ⮚ Summary ⮚ Problem/Solution

Solution
Divide the quantity column values by the non-zero and non-negative entries in
Step 4 the optimum column.

14 June 2020 Module 3: Linear Programming: Simplex Method

 END OF LESSON NO.
3
Any Questions?

14 June 2020 Module 3: Linear Programming: Simplex Method