Lecture Notes 4

Mathematics of the Modern World

Name:

Simplex “Maximization” Method of Linear Programming

Note: The method of solving a maximization problem is different from minimization in the simplex method.

Steps in Solving a Maximization Problem

1. Setup the constraints from the condition of the problem.

2. Convert the inequality explicit constraints to equations by adding slack variables.

3. Enter the numerical coefficients and variables in the simplex table.

4. Calculate Cj and Zj values.

5. Determine the optimum column and entering variable by choosing the most positive value in theCj −
Zj row.

6. Divide the quantity column values by the non-zero and non-negative entries in the optimum column.
The smallest quotient belongs to the pivotal row.

7. Compute the values for the replacing row by dividing all the entries by the pivot element (intersection
of optimum column and pivotal row). Enter the result in the next table.

8. Compute the entries of the remaining rows by reducing the optimum column entries to zero (entries in
the constraints row).

9. Calculate Cj and Zj values. Compute also for Cj − Zj row.

10. If there is a positive entry in the Cj − Zj row, return to step 5. The final solution or optimum solution has
been obtained if there is no positive entries in theCj − Zj row.

Converting the Constraints to Equation.

Maximization Problem containing the “Less Than or Equal” Symbol in the Constraints:

To convert the inequalities to equations, example 3x + 4y ≤ 45, the left members are less than the right
members, they can be equal if we add some quantities to the left. Let these quantities be called slack
variables denoted by Si where i goes to what equation the slack variable is included. The slack variables fill the
gap between the left and right members of the inequalities. It can also be said a slack variables represent the
unused quantities in the constraints. This can be seen in checking the objectives after the solutions are found.

Example:

Maximization Problem containing the “Greater Than or Equal” Symbol in the Constraints:

In a maximization problem, we always add a slack variable to convert a constraint to equation. But if the
constraint has a “≥” symbol, we cannot transform it to equation by immediately adding a slack variable for
obvious reason. We must convert first the ≥ symbol to a ≤ symbol. This is easily done by multiplying the
inequality constraint by negative 1, then add the slack variable. In this particular case, since the “greater than”
symbol implies a value bigger than the right member, the constraint containing the greater than symbol could
not have solution variables (i.e. x and y) both equal to zero for obvious reason. Hence, it is not possible for the
slack variable in this particular constraint to become negative.

Example:

Maximization Problem containing the “Equal” Symbol in the Constraints:

Rule: Add a slack variable to the left member of the constraint containing the equal symbol.

Example:

1
Sample Problem: Solve the Linear programming problem below using simplex max method

Problem:
The Deseo’s Furniture makes two products: tables and chairs, which must be processed through assembly and
finishing departments. Assembly department is available for 60 hours in every production period, while the
finishing department is available for 48 hours of work. Manufacturing one table requires 4 hours in the assembly
and 2 hours in the finishing. Each chair requires 2 hours in assembly and 4 hours in finishing. One table
contributes 180php. to profit, while a chair contributes 100php. The problem is to determine the number of
tables and chairs to make per production period in order to maximize the profit.

Notations:
Entering variable (EV), Optimum column (OC), Entering contribution (EC), Pivotal row (PR), Outgoing variable
(OV), Outgoing contribution (OCon), Pivot element (PE).

Decision variables:

Table of given:

Objective:

Subject to:

Reduced and Converted:

New objective:

Table 1

Table 2

Computation:

Table 3

Conclusion:

2
Recitation:
Quantitative Techniques in Business
UCC

Name:
CYS:

Directions: Answer the problem below using simplex method.

Problem:

A furniture factory manufactures wooden chairs, tables and cabinet. Each product under goes two processes:
assembly and finishing. Each chair requires 2 hours in the assembly and 3 hours in the finishing. Each table
requires 3 hours in the assembly and 4 hours in the finishing. Each cabinet requires 4 hours in the assembly and 2
hours in the finishing. The assembly department is available 48 hours per production period, while the finishing
department is available 36 hours. Each chair contributes 80.00Php profit, a table gives 200.00Php each and
each cabinet gives 250.00Php to profit. Determine a plan of production that will maximize the profit.

Decision variables:

Table of given:

Objective:

Subject to:

Reduced and Converted:

New objective:

Table 1

3
Table 2

Computation:

Table 3

Computation:

Table 4

Conclusion:

4
 Seatwork 2 (Midterm)
Mathematics of the Modern World

Name: Date:
Course/Year/ Section/Campus/Schedule: Student Number:

Solve the Linear programming problems below using Simplex Method. Note: The number of
tables in this questionnaire does not imply the exact number of tables to be used to solve the
problem.

Problem 1:
The Onato Company produces chairs, lamps and tables. Each chairs requires 6 minutes in
machine center A, 5 minutes in machine center B, and 8 minutes in machine center C. Each
lamp produces requires 5, 4 and 5 minutes in machine centers A, B and C respectively.
Likewise, each table produced requires 6, 4 and 6 minutes in machine centers A, B and C
respectively. The company has a daily availability of 2,400 minutes in center A, 2,000 minutes
in center B and 3,000 minutes in center C. Each chair gives 50.00Php profit, a lamp gives
100.00Php and a table gives 200.00Php. Find the number of each type of products to
produce in order to maximize the company’s profit.

Decision variables:

Table of given:

Objective:

Subject to:

Reduced and Converted:

New objective:

Table 1

5
Table 2

Computation:

Table 3

Computation:

Table 4

Conclusion:

6
Problem 2:
A poultry raiser plans to raise chicken, ducks and turkeys. He has room for only 200 birds and
wishes to limit the number of turkeys to a maximum of 25, the number of turkeys and ducks to
a maximum of 100. His estimated profits are 30.00Php, 25.00Php and 120.00Php on each
chicken, duck and turkeys respectively. How many of each should he raise to maximize his
profit?

Decision variables:

Table of given:

Objective:

Subject to:

Reduced and Converted:

New objective:

Table 1

Table 2

7
Computation:

Table 3

Computation:

Table 4

Conclusion: