Page 1 of 8

Name :
Course and Year :
Subject : Management Science
Class Schedule :
Instructor :

Module 3: Linear Programming – Graphical

Intended Learning Outcomes

 Define linear programming
 Enumerate the methods of solving linear programming problems.
 Solve linear programming problems using the graphical method

Activity
Putting yourselves in the shoes of a business manager or executive, enumerate 3 to 5
items/matters that you want to: (a) maximize and (b) minimize in doing business.
Enumerate the possible ways of achieving those and enumerate possible
constraints/limitations.

Analysis
Every student in a business program has considered becoming an executive or
manager after graduation. A good manager can maximize the company’s profit and minimize
its cost without violating any limitation or restriction on existing variables, such as time and
quantity of available raw materials. Linear programming is a vital tool in management
science. This quantitative technique in management is so important that it results in
enormous savings of money.

Abstraction

1. Linear Programming Defined

a. The word “linear” implies direct proportionality of relationship of variables.
b. “Programming” means making schedules or plans of activities to undertake in
the future.
c. “Linear Programming” therefore is planning by the use of linear relationship of
variables involved
d. It makes use of certain mathematical techniques to get the best possible solution
to a problem involving limited resources.

2. Properties of linear programming problems.

a. A minimization or maximization problem can be classified as linear programming
if it has the following properties:
i. The objective of the decision –maker must be either to maximize or
minimize
 Page 2 of 8

ii. The actions of the decision-maker must be constrained and the

decision variables must not violate the limitations or constraints.
iii. All variables have a value greater than or equal to zero
iv. The relationship of variables could be expressed in terms of
equations or inequalities.

3. Two ways of solving linear programming problems

a. Graphical Method (Module 3)
- Can only be used if the problem has 2 or 3 variables, since there
are only 2 coordinate axes in a plane and 3 coordinates in space.
b. Simplex Method (Module 4)
- Can handle a problem having any number of variables.

4. Graphical Method
a. As the name implies, this method makes use of graphs to arrive at the optimum
solution.
b. Optimum Solution is a solution that makes the objective function as large in the
case of maximization process, and as small as possible in the case of
minimization process.
c. The set of all points in the graph satisfying the constraints is called feasible
solution, and the points are located in the feasible region.

5. Two main parts of linear program

a. The objective function
- An algebraic expression introduced by the word “maximize” or minimize.
b. The constraints or limitations
- Introduced by “subject to”
- These algebraic sentences in the constraints are expressed in equation or
inequalities.

6. Two parts of the constraints

a. Explicit are conditions of the problem which are to be expressed in mathematical
sentences.
b. Implicit are those that are implied. Example, if we talk of time or raw material as
variable in a given problem, it is needless to specify in the problem that the
quantity is always positive. Hence the condition that the variable representing
time or raw material must be always positive, is an implicit constraint.

7. Steps to follow in Using the Graphical Method

1. Represent the unknown in the problem
2. Tabulate the data about the unknown (if necessary)
3. Formulate the objective function and constraints
4. Graph the constraints, and always solve for the coordinates at the point of
intersection lines.
5. Substitute the coordinates at the vertices of the feasible region in the objective
function.
6. Formulate your decision by selecting the highest value of the objective if its
maximization and the lowest value if it is minimization.

8. Illustrations
a. EXAMPLE 1: The Margan Furniture
 Page 3 of 8

The Margan 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 the assembly and 4 hours in the finishing. One table
contributes P180 to profit, while a chair contributes P100. The problem is to
determine the number of table and chairs to make per production period in
order to maximize the profit.

Solution:
Step 1: Represent the unknown in the problem
Let x = number of tables
Let y = number of chairs.

Step 2: Tabulate the data about the unknown

Time in Assembly Time in Finishing Profit
Tables (x) 4x 2x 180x
Chairs (y) 2y 4y 100y

Step 3: Formulate the objective function and constraints

Maximize: (objective)
Subject to:
constraints

Step 4: Graph the constraints

Graph The Equations

Graph is the y- Graph is the x-

axis, since x=0 axis, since y=0

(15, 0) (0, 30) (24, 0) (0,12)

Testing the Origin; x and y are equal to zero (0)
Graph should include positive
values/quadrant
True, the graph should True, the graph should
include the origin include the origin
 Page 4 of 8

GRAPH:

● (0, 30)

(0, 12)
●
(12,6)

● (24, 0)
(15,0)
● ●

Vertices of the Feasible Region:

(0, 12)
(15, 0)
(12, 6)

Alternative way of computing the intersection point (by substitution or

elimination)

Common Solution or intersection point: (12,6)

 Page 5 of 8

Step 5: Substitute the coordinates at the vertices of the feasible region

in the objective function

Vertices Objective Function: Maximize:

(0, 12)
(15, 0)
(12, 6)

Step 6: Formulate your decision by selecting the highest value of the

objective if its maximization and the lowest value if it is minimization.

Since it is maximization, look for the highest outcome in the substitution of

vertices.

Therefore, since (12, 6) produces the maximum amount of the objective

function, therefore, the decision must be to produce:
x = 12 number of tables
y = 6 number of chairs
Maximum Profit = P2, 760

To check, substitute the values of x and y to the constraints function to see if

the constraints are satisfied

b. EXAMPLE 2: Ramos Company

Ramos Company utilizes a small generator. Such small generator burns two
types of fuel: low sulfur and high sulfur to produce electricity. For one hour,
each gallon of low sulfur emits 3 units of sulfur dioxide, generates 4
kilowatts of electricity and costs P160. Each gallon of high sulfur emits 5
units of sulfur dioxide, generates 4 kilowatts and costs P150. The
environmental protection agency insists that the maximum amount of sulfur
dioxide that can be emitted per hour is 15 units. Suppose that at least 16
kilowatts must be generated per hour, how many galloons of high sulfur
and low sulfur must be utilized per hour in order to minimize the cost of fuel?

Solution:
Step 1: Represent the unknown in the problem
Let x = number of gallons of low sulfur
Let y = number of gallons of high sulfur

Step 2: Tabulate the data about the unknown

Units of Sulfur No. of Kilowatts Cost
Oxide
Low Sulfur (x) 3x 4x 160x
High Sulfur (y) 5y 4y 150y

Step 3: Formulate the objective function and constraints

 Page 6 of 8

Minimize: (objective)
Subject to:
constraints

Step 4: Graph the constraints

Graph The Equations

Graph is the y- Graph is the x-

axis, since x=0 axis, since y=0

(5, 0) (0, 3) (4, 0) (0,4)

Testing the Origin; x and y are equal to zero (0)
Graph should include positive
values/quadrant
True, the graph should False, the graph should NOT
include the origin include the origin

(0, 4)
●

(0, 3) ●
(2.5, 1.5)
●

(4, 0) ● ●
(5, 0)

Vertices:
(2.5, 1.5)
 Page 7 of 8

(4, 0)
(5, 0)

Alternative way of computing the intersection point (by substitution or

elimination)

Common Solution or intersection point: (2.5, 1.5)

Step 5: Substitute the coordinates at the vertices of the feasible region

in the objective function

Vertices Objective Function: Minimize:

(2.5, 1.5)
(4,0)
(5,0)

Step 6: Formulate your decision by selecting the highest value of the

objective if its maximization and the lowest value if it is minimization.

Since it is minimization, look for the highest outcome in the substitution of

vertices.

Therefore, since (2.5, 1.5) produces the maximum amount of the objective
function, therefore, the decision must be to utilize:
x = 2.5 number of gallons of low sulfur
y = 1.5 number of gallons of high sulfur
Minimum cost P625

To check, substitute the values of x and y to the constraints function to see if

the constraints are satisfied
 Page 8 of 8

Application
Write your answers in any clean piece of paper. Take a picture and submit it via Google
Classroom. Ensure that every sheet of your submission is labeled with your name.
Show your solution and box-in your final answer.

1. A steel producer makes two types of steel: regular and special steel. A ton of
regular steel requires 2 hours in the open-hearth furnace and 3 hours in the
soaking pit; a ton of special steel requires 2 hours in the open-hearth furnace
and 5 hours in the soaking pit. The open-hearth furnace is available 8 hours per
day and the soaking pit is available 15 hours per day. The profit on a ton of
regular steel is P4, 000 and it is P6, 000 on a ton of special steel. Determine how
many tons o each type of steel should be made to maximize profit, considering
that demand on regular steel is at least 1 ton.

2. An animal food producer mixes two types of animal food: x and y. Each unit of x
cost P100 and contains 40 grams of fat, 20 grams of protein and 1,600 calories.
Each unit of y costs P80 and contains 60 grams of fat, 60 grams of protein and
1, 200 calories. Suppose the producer wants each unit of the final product to
yield at least 360 grams of fat, at least 240 grams of protein and at least 9,600
calories, how many of each type of grain should the producer use to minimize his
cost?

***NOTHING FOLLOWS**