MS301 – MANAGEMENT SCIENCE

LINEAR PROGRAMMING (GRAPHICAL

METHOD)
LESSON 2: LINEAR PROGRAMMING
Lesson Objectives: At the end of the lesson, you will be able to:

 State the nature and application of linear programming

 Enumerate the steps to follow in using the graphical method
 State the meaning of optimal solution and feasible solution
 Setup correctly the objective function and the constraints from given word problems
 Solve Linear Programming problems graphically and interpret the solutions
WHAT IS LINEAR PROGRAMMING?
• The word “linear” implies direct proportionality of relationships of variables
• “Programming means making schedules or plans of activities to undertake in the future
• “Linear Programming” is planning by the use of linear relationship of variables involved. It
makes use of certain mathematical techniques to get the best possible solution to a problem
involving limited resources.
WHAT IS LINEAR PROGRAMMING?
A minimization or maximization problem can be classified as linear programming if it has the
following properties:

1) The objective of the decision-maker must be either to maximize or minimize.

2) The actions of the decision-maker must be constrained and the decision variables must not violate
the limitations or constraints.

3) All variables have a value greater than or equal to 0.

4) The relationship of variables could be expressed in terms of equations or inequalities.

WHAT IS LINEAR PROGRAMMING?
Two ways of Solving a Linear Programming Problem

1. Graphical method – 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.

2. Simplex method – can handle a problem having any number of variables.

GRAPHICAL METHOD OF LINEAR PROGRAMMING

As the name implies, this method makes use of graphs to arrive at the optimum solution.

• Optimum Solution – is a solution that makes the objective function as large as possible in the case
of maximization process, and as small as possible in the case of minimization process.

• Feasible region – graph of the linear system of constraints; it is the region containing all the points
in the graph satisfying each of the constraints.

• Feasible solution – set of all points located in the feasible region.

GRAPHICAL METHOD OF LINEAR PROGRAMMING

Two main parts of a linear program:

1. Objective function – an algebraic expression introduced by the word “maximize” or “minimize.”

2. Constraints or limitations – introduced by “subject to.” These algebraic sentences in the

constraints are expressed in equations or inequalities.

Two parts of the constraints:

3. Explicit – conditions of the problems which are to be expressed in mathematical sentences

4. Implicit – are those that are implied. If we talk of time or raw material as a 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.
GRAPHICAL METHOD OF LINEAR PROGRAMMING

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 of lines.

5. Substitute the coordinates at the vertices of the feasible region to the objective function.

6. Formulate your decision by selecting the highest value of the objective if it is maximization and the lowest
value if it is minimization.

• Note: It has been proven that the maximum or minimum value always occurs at a vertex of the feasible region.
GRAPHICAL METHOD OF LINEAR PROGRAMMING
Example 1:

The 4H Furniture Company 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 ₱180 to profit, while a chair
contributes ₱100. The problem is to determine the number of tables and chairs to make per
production period in order to maximize the profit.
GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:

Time in Assembly Time in Finishing Profit

Let x = number of tables 4x 2x 180x

Let y = number of chairs 2y 4y 100y

GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Formulating the objective function and constraints:
Maximize:

Subject to:
GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Graph of the constraints:
4
GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
The coordinates (12, 6) at the intersection of the lines are obtained by solving the common
solution of the system:

Finding the Optimum Solution:

Taking the coordinates at the vertices and substituting them in the objective function:

Vertices Objective: 180x + 100y

(0, 12) 180(0) + 100(12) = 0 + 1200 = 1200

(15, 0) 180(15) + 100(0) = 2700 + 0 = 2700
(12, 6) 180(12) + 100(6) = 2160 + 600 = 2760
GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Since (12, 6) produces the maximum amount of the objective function, therefore the decision must
be:
x = 12 number of tables
y = 6 number of chairs
Maximum profit: ₱2,760
GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
To check whether the solution set is correct, substitute the values of the solution variables in the
constraints and find out if the constraints are satisfied.

First constraint:

This means that the assembly department which is available for 60 hours must be used
for 60 hours.
GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Second constraint:

This means that the finishing department which is available for 48 hours, must be used
for 48 hours.
 GRAPHICAL METHOD OF LINEAR PROGRAMMING

Example 2:
A 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 electricity and
costs ₱160. Each gallon of high sulfur emits 5 units of sulfur dioxide, generates 4 kilowatts and costs
₱150. 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 gallons of high sulfur and low sulfur must be utilized per hour in order to minimize the cost of
fuel?
 GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:

Units of sulfur No. of kilowatts Cost

dioxide

Let x = no. of gallons of low sulfur 3x 4x 160x

Let y = no. of gallons of high sulfur 5y 4y 150y

 GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Minimize:

Subject to:
 GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Graph of the constraints:
 GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
The coordinates (2.5, 1.5) are obtained by the elimination method in the system:

Finding the Optimum Solution:

Substitute the coordinates at the vertices in the objective function:

Vertices Objective: 160x + 150y

(4, 0) 160(4) + 150(0) = 640 + 0 = 640
(5, 0) 160(5) + 150(0) = 800 + 0 = 800
(2.5, 1.5) 160(2.5) + 150(1.5) = 400 + 225 = 625
 GRAPHICAL METHOD OF LINEAR PROGRAMMING

Solution:
Since 625 is the smallest value, therefore the decision should be:
x = 2.5 no. of gallons of low sulfur
y = 1.5 no. of gallons of high sulfur
Minimum cost: ₱625

Note: Try to check whether the solution set is correct 😊.