LEARNER’S MODULE:

Mathematics in the Modern World

Chapter 7: Linear Programming

I. OBJECTIVES:
At the end of the chapter, you are expected to:
a. Determine the solution of linear inequalities and systems of linear
inequalities; and
b. Determine the optimal solution of a linear programming problem
using the graphical method and simplex method.

II. OVERVIEW
Improving our way of living is one of our goals in life. With the given
resources that have, we want to make most out of them.
In this Chapter, Linear Programming (LP) is one of the simplest ways
to perform optimization. It helps you solve some very complex
optimization problems by making a few simplifying assumptions. As an
analyst you are bound to come across applications and problems to be
solved by Linear Programming.

III. DISCUSSION
A. Linear Inequalities in Two Variables
Linear inequalities are very useful in the study of economics,
statistics, business, engineering, science and other areas. In this
section, solutions of linear inequalities are discussed which will
become an introduction to linear programming.

Statements of the form

Ax + By > C Ax + By < C (strict inequality)
Ax + By ≥ C Ax + By ≤ C (mixed inequality)
Where A, B, and C are constant, and A, B, and C are not both zero,
are inequalities of the first degree in two variables.

B. Solutions of Linear Inequalities in Two Variables

The solution of linear inequality in two variables is a subset of the
plane consisting of all points (x,y) whose coordinates satisfy the
inequality. Hence, determining the solution of graphing the linear
inequality.

Steps:
1. Replace the inequality symbol with equality. This is the equation
of the boundary line of the desired region which is considered the
solution or feasibility region.
2. Graph the boundary line (if the inequality involves ≥ or ≤, the
boundary line is solid indicating that the points in the line are
included in the solution. If the inequality is > or <, a broken line is
used indicating that the points on the line are not solutions of the
inequality.
3. Choose a point not on the boundary line, if possible (0,0) and
substitute the coordinates in the given inequality.
4. If the point satisfies the inequality, shade the region containing it.
Otherwise, shade the region on the other side of the boundary
line. The shaded region is the solution.

BRYAN S. AMBRE | Sir Amber

bryanamber029@gmail.com
0955-417-3898
 LEARNER’S MODULE:
Mathematics in the Modern World
Example:
1. Graph y > 2x + 4
Step 1: The equation is y = 2x + 4. Take the ordered pairs (0,4) and (-2,0).
These are the intercepts of the equation. Then graph on the Cartesian
plane.
Step 2: The boundary line is a broken line since the inequality is strict (>).

Step 3: Choose (0,0) and the test the given inequality from y > 2x + 4.
Therefore, 0 > 2(0) + 4 can be simplified as 0 > 4.
Step 4: 0 > 4 is not true; hence, shade the other side of the boundary line.
(not in the region where (0,0) is located)

2. Get the solution region of y ≤ 4.

Step 1: the equation is y = 4. Graph.
Step 2: the graph is a horizontal line passing through (0,4). The boundary line
is solid line.
Step 3: decide for the region to shade from the inequality which is y ≤.
If 0 is substituted to y, 0 ≤ 4.
Step 4: since it is true that 0 ≤ 4, shade the region where y = 0 is located.

BRYAN S. AMBRE | Sir Amber

bryanamber029@gmail.com
0955-417-3898
 LEARNER’S MODULE:
Mathematics in the Modern World
C. System of Linear Inequalities in Two Variables
When two or more linear inequalities in one variable are graph
in one rectangular coordinate plane, the result is a system of linear
inequalities in two variables. The solution of the system is the
intersection of the region common to every graph in the system.
These are the set of points satisfying all the inequalities in the system.

Example: Solve the system consisting of the inequalities

2x – 3y ≥ 6
y>4
Step 1: begin by determining the boundary lines. Change the inequality
symbols to equations
a. 2x – 3y = 6
b. y = 4
Step 2: Graph the boundary line one at a time and perform the test.
a. For 2x – 3y = 6, use the ordered pair (0,-2) (3,0). The first boundary
line is solid line since the inequality is mixed, (≥)
 Test (0,0) in the inequality 2x – 3y ≥ 6. The result is 0 ≥ 6 which is not
true; hence, the lower part of the line is shaded.

In the same rectangular coordinate plane, the second equation which is

the next boundary line.

 Since the inequality is y > 4, the boundary line is broken line. The upper
part of the second boundary line is shaded.

 The double shaded region is the solution of the feasibility region.

D. Linear Programming
One application system of linear inequalities is linear
programming.
Linear Programming (LP) is a method to achieve the best
outcome (such as maximum profit or lowest cost) in a mathematical
model whose requirements are represented by linear relationships.

BRYAN S. AMBRE | Sir Amber

bryanamber029@gmail.com
0955-417-3898
 LEARNER’S MODULE:
Mathematics in the Modern World
Linear programming is a special case of mathematical programming
(mathematical optimization). A typical example would be taking the
limitations of materials and labor, and then determining the “best”
production levels for maximal profits under whose conditions.
A linear programming model seeks to maximize a linear
function, subject to a set of linear constraints.

E. Fundamental Theorem of Linear Programming

The following are the fundamental theorems (Podmanik, 2018).
1. If a solution exists to a bounded linear programming problem,
then it occurs at one of the corner points.
2. If feasible region is unbounded, then a maximum value for the
objective function does not exist.
3. If a feasible region is unbounded, and the objective function has
only positive coefficients, then a minimum value exists

F. Solving Linear Programming Problem Graphically:

1. Define the variables to be optimized. The question asked is a good
indicator as to what these will be.
2. Write the objective function in words, then convert to
mathematical equation.
3. Write the constraints in words, then convert to mathematical
equation.
4. Graph the constraints as equations.
5. Shade feasible regions by taking into account the inequality sign
and its direction if
a. A vertical line
≥, then shade to the right
≤, then shade to the left
b. A horizontal line
≥, then shade above
≤, then shade below
c. A line with a non-zero, defined slope
≥, shade above
≤, shade below
6. Identify the corner points by solving systems of linear equations
whose intersection represent a corner point.
7. Test all points in the objective function. The “winning” point is the
point that optimizes the objective function (biggest if maximizing,
smallest if minimizing).

Example: 1. Solve the linear programming problem by graphical method:

a. Maximize z = 12x + 16y (objective function)
subject to the following constraints
10x + 20y ≤ 120
8x + 8y ≤ 80
X and y ≥ 0
Solution:
1. Find the x and y intercepts of the given constraints to determine the lines
and sketch the graph to identify the feasible region.

10x + 20y ≤ 120 => (0,6) and (12,0)

8x + 8y ≤ 80 => (0,10) and (10,0)

BRYAN S. AMBRE | Sir Amber

bryanamber029@gmail.com
0955-417-3898
 LEARNER’S MODULE:
Mathematics in the Modern World

Since the symbol used is less than or equal to so the feasible region is the region
below the lines. And look for the coordinates of the four (4) corner points of the
feasible region:
A(0,0), B(10,0) C(8,2) D(0,6)
And solve for the z(A), z(B), z(C), and z(D) using the objective function.
z(A) = 12(0) + 16(0) =0
z(B) = 12(10) + 16(0) = 120
z(C) = 12(8) + 16(2) = 128 maximum corner point C
z(D) = 12(0) + 16(6) = 96

therefore, the optimum value is 128, the optimum point is C(8,2) and the optimum
solution is x=8 and y=2.

BRYAN S. AMBRE | Sir Amber

bryanamber029@gmail.com
0955-417-3898