Linear Programming

GRAPHICAL METHOD
Topics
01. Overview of linear programming
02. Parts of linear programming
03. Assumptions in linear programming
04. Feasible region
05. Optimal solution

2
Overview
Linear programming is a quantitative
technique used in properly allocating the
resources of a business to maximize its
profit or minimize cost. The term linear
signifies the existence of a proportional
relationship between variables, which can
either be direct or inverse.

3
“
A directly proportional relationship exists when an
increase in one variable corresponds to an increase in
another variable.

An inversely proportional relationship exists when an

increase in one variable results in a decrease in another
variable or vice versa.

4
“
Programming refers to the use of a mathematical model
when developing an equation to solve a problem.

The term is not related to computer programming.

5
Four properties of linear
programming problems
Presence of objective function Presence of constraints

The objective of a linear programming problem There are constraints that restrict or limit the
is either to maximize profit or minimize cost. attainment of an objective. The limitations may
The term profit is the difference between the be in the form of plant capacity, availability of
revenue and the variable cost. The term cost materials, direct labor or personnel, or time. The
simply refers to the variable cost. The fixed cost limitations or constraints should not be violated
is not included because it is not linearly related in determining the optimum solution. The
to the revenue. The fixed cost remains constant constraints or limitations must be expressed in
in relation to the changes in revenue and equalities or inequalities.
production. The objective of a linear
programming problem must be expressed in an
equality.

6
Four properties of linear
programming problems
Availability of alternatives Linear mathematical relationship

Since there are two or more variables used This property means that the relationship of the
when developing a linear programming variables in linear programming is considered
problem, there are different alternative courses linear and can be expressed in equalities or
of action to choose from. The alternative inequalities. The objectives, functions, and
courses of action may favor the selection of one constraints must be in their first degree
variable over another or it may involve the level (e.g., 3X + 4Y = 25).
mixture of two or more variables.

7
Assumptions of linear programming
Certainty Proportionality Additivity

There is certainty that the Proportionality exists among There is additivity in the
objective function and the the variables in the objective mathematical model. This
constraints will not change function and constraints. assumption means that the
during the period of the study. sum of all activities is equal to
The mathematical equation the sum of the different
that has been developed individual activities.
should remain the same as
well.

8
Assumptions of linear programming
Divisibility Non-negativity

The optimum solution may The value of the decision

take the form of a fraction, not variables should be positive or
necessarily an integer or a zero. This assumption is also
whole number. However, an known as logical constraint
integer programming problem since a company cannot
will exist when a fractional product a negative number of
form results in manufacturing products.
a product.

9
Parts of a linear
programming model

Objective function Constraints

• Denotes the maximization of profit • Introduced by the words “subject
to”
or minimization of cost
• Usually introduced by the words
“maximize” or “minimize” Two types of constraints
• Explicit constraints – limitations that
are expressed or stated in a problem
• Implicit constraints – implied
limitations or non-negativity
assumptions. These constraints
should not be violated.
10
Methods of solving a linear
programming problem

01. Graphical method

02. Simplex method

11
Graphical method
The graphical method utilizes a two-
dimensional graph to solve linear
programming problems.

This method is used if the linear

programming model consists of no more
than two variables.

12
Steps involved in the
graphical method
Steps involved in the
graphical method
Step 1 Step 2 Step 3 Step 4

Use letters to If necessary, Formulate the Graph the

represent the prepare a simple objective constraints. If
unknowns or matrix to function and the the lines
variables in the facilitate the constraints in intersect, solve
problem. formulation of equalities and for the
the constraints. inequalities. coordinates of
the intersection
point.
14
Steps involved in the
graphical method
Step 5 Step 6 Step 7

Determine the Determine the Formulate the

feasible region. optimum decision based
solution. on the highest
profit or lowest
cost.

15
“
The feasible region contains all the points in the graph
where the optimum solution can be found. It is the
region where the constraints are not violated.

16
Maximization of profit
Jenny Furniture Shop produces two types of tables: an elegant table and
an ordinary table. The table, whether elegant or ordinary, passes through
two departments, namely, the assembly department and finishing
department. Each elegant table requires 8 hours of assembly work and 4
hours of finishing tasks. Each ordinary table requires 6 hours in the
assembly department and 2 hours in the finishing department. Every
production period, the shop has 480 hours of assembly time and 200
hours of finishing time. The elegant table contributes 700 to the
company's profit, while the ordinary table has a profit of P500.
Required. Using the graphical method of linear programming, determine
the number of units needed to be produced to maximize profits. 17
Step 1
Use letters to represent the unknowns or variables in the
problem.
Step 2
If necessary, prepare a simple matrix to facilitate the
formulation of the constraints.
Step 2

Hours per unit of X Hours per unit of Y Available hours

Assembly
department 8 6 480
Finishing
department 4 2 200

Profit 700 500

20
Step 3
Formulate the objective function and the constraints in
equalities and inequalities.
Step 4
Graph the constraints. If the lines intersect, solve for the
coordinates of the intersection point.
Step 4

23
Step 5
Determine the feasible region.
Step 5

25
Step 6
Determine the optimum solution.
Step 7
Formulate the decision based on the highest profit or lowest
cost.
“
The optimum solution is to produce 30 units of elegant
tables and 40 units of ordinary tables to realize a
profit of PhP41,000.

28
Minimization of cost
To operate the newly imported state-of-the-art machinery recently purchased by
ABC Company, two types of fuels are needed, namely, Fuel A and Fuel B. The
machine specifications and requirements show that for every one hour of
production time, each gallon of Fuel A emits 6 units of chemical gas and
generates a mechanical energy equivalent to 8 horsepower. This costs P320. In
a similar manner, each gallon of Fuel B emits 10 units of chemical gas and
generates 8 horsepower of mechanical energy. This costs P300. The maximum
number of units of such type of chemical gas allowed by the government to be
emitted by such type of machinery is 30 units. The operating activities of the
company require at least 32 horsepower of mechanical energy per hour.
Required. Using the graphical method, determine the number of gallons of
Fuel A and Fuel B that are needed to operate the machine at the lowest
29
possible cost.
Step 1
Use letters to represent the unknowns or variables in the
problem.
Step 2
If necessary, prepare a simple matrix to facilitate the
formulation of the constraints.
Step 2
Chemical gas
Mechanical energy Cost
emitted

X 6 8 PhP320

Y 10 8 PhP300

30 32

32
Step 3
Formulate the objective function and the constraints in
equalities and inequalities.
Step 4
Graph the constraints. If the lines intersect, solve for the
coordinates of the intersection point.
Step 4

35
Step 5
Determine the feasible region.
Step 5

37
Step 6
Determine the optimum solution.
Step 7
Formulate the decision based on the highest profit or lowest
cost.
“
The optimum solution is to use 2.5 gallons of Fuel A
and 1.5 gallons of Fuel B for the optimum cost of
PhP1,250.00

40
Special cases in linear programming

Infeasibility
This occurs when there are no solutions to a linear programming problem
that could meet the requirements of the constraints. This happens when
the constraints are conflicting, and no feasible region can be determined.

41
Infeasibility

42
Special cases in linear programming

Unboundedness
This occurs when the maximization problem can have infinitely large values
without violating the requirements of the constraints. This happens when
the linear programming constraints are wrongly formulated, thus resulting in
one or more missing constraints.

43
Unboundedness

44
Special cases in linear programming

Redundancy
This happens when there is a redundant constraint, such as a requirement
or limitation, that will not affect the feasible region. This indicates that the
feasible region can still be determined even if the redundant constraint is
removed from the model.

45
Redundancy

46
Special cases in linear programming

Alternate optimal solution

This occurs when two or more optimal solutions exist with the same level of
profit regardless of the selected combination. This happens when the slope
of the isoprofit or isocost is perfectly parallel to one of the constraints in the
problem

47
Alternate optimal solution

48
Thank you
Questions?

49