MODULE 5: INTRODUCTION TO LINEAR PROGRAMMING

INTRODUCTION
In the manufacturing industry, Linear Programming is a very effective tool to determine the number
of Units that a company must produce in order to maximize profit or minimize the cost of production. That
way, they will be able to avoid losses and gain more profit from the available resources.
This module covers introductory topics in linear programming, and a short discussion on graphing
linear inequalities which will be used to solve Linear Programming problems by graphical method.
You are expected to study this lesson and accomplish your tasks within two weeks, upon receiving
this module (3rd and 4th week of this cluster).

LEARNING OUTCOMES
By the end of this module, you should have been able to:
a. identify the basic concepts of Linear Programming;
b. solve Linear Programming problems using graphical method;
c. understand and discuss the importance of the application of Linear programming to various fields.

MOTIVATION

Role Play
If you were to play the role of a businessman, what strategies
will you do in order to maximize the income of your business, and
avoid losses in the long run?

CONTENT
To solve Linear Programming Problems, there is a need to review linear inequalities. So what is a Linear
Inequality?
Linear Inequality is an inequality in which the variables appears only in the first degree and uses a
symbol other than the equality sign. The most common inequality symbols are<, >, ≤, ≥. Linear inequalities
𝑟𝑖𝑠𝑒
exist in two forms: the slope-intercept form 𝑦 = 𝑚𝑥 + 𝑐 where c is the y-intercept and m is the slope (a.k.a )
𝑟𝑢𝑛
of the intercept; and 𝑎𝑥 + 𝑏𝑦 = 𝑐 also known as the standard form. (Note: we will use equality symbol for now
and worry for the inequality symbol later because solving linear inequalities is just like solving Linear Equation
except for the equality and inequality signs).

Examples of Linear Inequality: 𝑦 < 2, 𝑦 > 2, 𝑥 ≤ 2, 𝑥 ≥ 2, 𝑦 ≥ 3𝑥 + 4, 3𝑥 + 2𝑦 ≥ 6

THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION, UPLOADING,
OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS STRICTLY PROHIBITED. 1
 Solving Linear Inequalities by Graphical Method
Examples:
1. 𝒚 < 𝟐 When graphing a linear inequality:
1. y < 2 is written in  When graphing a line using < or >, a dashed or
the form y=mx+c, y
2. Horizontal line
where x=0, (dashed) graph for y < 2 broken lines are used to represent the line. When
making m=0 and
(0, 2)
the inequality is ≤ or ≥, a whole or solid lines are
y-intercept = 2. y<2
When m is 0, we used.
3. The shaded area
get a horizontal x
are the solutions of  When using the symbols < or ≤, the shaded area
line. Thus, the
coordinates (0, 2).
the inequality or the would be below the horizontal line graph or to the
feasible region.
left of the vertical line graph.
 When using the symbols > or ≥, the shaded area
would be above the horizontal line graph or to the
right of the vertical line graph.
 The x-intercept is where a line crosses the x-axis,
or when y = 0.
 The y-intercept is where a line crosses the y-axis,
or when x = 0.
 The solution to the inequality, is the set of all points
2. Vertical line (solid) satisfying the inequality or the feasible region.
graph for x ≥ 2
3. Solid line graph for y ≥ 3x+4
2. 𝒙 ≥ 𝟐 1. The inequality would give 3. 𝒚 ≥ 𝟑𝒙 + 𝟒
y us x-intercept=2, thus the y
y≥2 y ≥ 3x +4
coordinates (2, 0). But 2. y ≥ 3x+4 is written in the form
whatever value we assign 𝑟𝑖𝑠𝑒 3
(1,7) y=mx+c, where m = 3 or 𝑟𝑢𝑛 = 1.
with y, the point would
(2, 0) still be plotted on the same Meaning from point (0, 4), you
x (0,4) have to move 3 units up and 1
vertical line.
unit to the right. Thus, the
coordinates (1, 7). Then connect
3. Feasible region. the two points that will make the
x
graph of the inequality.

4. Using a test point (0, 0), meaning,

changing x & y to zero, would not 1. y ≥ 3x+4 is written in the form
satisfy the inequality. Hence, the y=mx+c, where y-intercept = 4,
feasible region is towards the left side thus, the coordinates (0, 4).
of the diagonal line or away from 0.
4. 𝟐𝒙 − 𝟑𝒚 ≤ 𝟔
1. The inequality is written in the form ax + by = c, therefore, we have to find the x-intercept &
y-intercept first. Before we can plot the points. y
5. Using a test point (0, 0)
x-intercept y=0 would satisfy the
inequality. Hence, the
2x – 3(0) = 6 feasible region is towards
2x = 6 (divide both side by 2) (3, 0)
x
the left side of the
x=3 (0, -2)
diagonal line.
y-intercept x=0
2. x-intercept = 3, thus
2(0) – 3y = 6 2x - 3y ≤ 6 the coordinates (3, 0)
-3y = 6 (divide both side by -3)
y = -2 3. y-intercept = -2, thus the coordinates (0, -2)
4. Connecting the two points makes a solid
line graph for 2x – 3y = ≤6

THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION, UPLOADING,
OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS STRICTLY PROHIBITED. 2
 5. Find the solution set of the given system of linear inequalities by graphical method.
𝑥 + 2𝑦 ≤ 6
 First is you have to find the x and y-intercepts of the inequalities 𝑥 + 2𝑦 ≤ 6
𝑥−𝑦 ≥ 3 and𝑥 − 𝑦 ≥ 3. It would be easier if we will put it in a table
x + 2y ≤ 6
𝑥≥0 When x = 0, the inequality will become 0 + 2y ≤ 6, solving for the
x y
0 3 inequality will give us y-intercept = 3. Hence, the coordinates (0, 3)
𝑦≥0
6 0
When y = 0, the inequality will become x + 2(0) ≤ 6, solving for the
inequality will give us x-intercept = 6. Hence, the coordinates (6, 0)
y x-y≥3
x x - y ≥ 3y When x = 0, the inequality will become 0 – y ≥ 3, solving for the inequality
x0 y
-3 will give us y-intercept = - 3. Hence, the coordinates (0, -3)
x- y≥3 0 -3
3 0
(0, 3)
3 0 When y = 0, the inequality will become x – 0 ≥ 3, solving for the inequality
will give us x-intercept = 3. Hence, the coordinates (3, 0)
(6, 0) x
 Second is to graph the inequalities using the coordinates in step 1.
(3, 0) x + 2y ≤ 6
 Third is to find the feasible region. Since x ≥ 0 and y ≥ 0, the solution is
(0, -3) restricted only to the points in the first quadrant. Note that the intersection
between the two lines is the solution of the given system of linear inequalities
since that is the region common among these inequalities.
 Fourth is to find the vertices or corner points of the feasible region. The two
This is how your graph will look like
coordinates are already given, (3, 0) and (6, 0). The third vertex is where the
after performing steps 1, 2, and 3.
line graphs intersect. To find the third vertex, find the value of either x in
terms of y or of y in terms of x. The given are:
y  x + 2y = 6 We will solve them as an equation
x-y=3
Finding x in the second equation x – y = 3, we have x = 3 + y.
x- y≥3 x=3+y Work on a less complicated equation.
(0, 3)
3 + y + 2y = 6
(4, 1)
3y = 6 - 3 Find y in terms of x. Substituting the value of x in the first equation
(6, 0) x 3y = 3 will give (3+y) +2y=6
(3, 0) x + 2y ≤ 6 y=1
Combine like terms, then divide both sides by 3 to get y = 1
(0, -3) x=3+y Now going back to this equation, we can now solve for the
x=3+1 value of x. By substituting y with 1, x will be equal to 4.
x=4
This is how your final graph will
look like after performing steps 1 – 4. Since we got x = 4 and y = 1, the coordinates of the intersection will be (4, 1).
Hence, the solution set or the feasible region is the region bounded by the triangle with
vertices (3, 0), (6, 0), (4, 1).

THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION, UPLOADING,
OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS STRICTLY PROHIBITED. 3
 REFERENCES
Romeo M. Daligdig, EdD (2019). Mathematics in the Modern World. Introduction to Linear Programming.

Lorimar Publishing,Inc.

Earnhart, R T., and Adina E M. (2018). Mathematics in the Modern World. Introduction to Linear

Programming. C & E Publishing,Inc.

Medallon M, Calubaquib (2018). Mathematics in the Modern World. Introduction to Linear Programming.

Mindshapers Co., Inc. 15, 27 - 32

(nd). Inequalities and Linear programming. From https://www.courses.lumenlearning.com/sanjacinto-

finitemath1/chapter/reading-meeting-demands-with-linear-prgramming

THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION, UPLOADING,
OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS STRICTLY PROHIBITED. 4