INEQUALITIES AND
LINEAR PROGRAMMING
Cheryl M. Silaba
is a statement that one quantity or
expression is greater or less than another
quantity or expression.
INEQUALITY
is the opposite of equality because
equality states that one quantity or
expression is exactly equal to another
quantity or expression.
PROPERTIES OF
INEQUALITY
1. For any real numbers a and b, exactly one of the following is true:
TRICHOTOMY PROPERTY
1. . For all real numbers a, b and c:
a.)
ADDITION PROPERTY
1. For any real numbers a,b, and c:
a.)
b.)
MULTIPLICATION PROPERTY
1. For all real numbers a, b, and c:
a.
b.
DIVISION PROPERTY
1. For all real numbers a, b and c.
a.)
b.)
EXPONENTIAL PROPERTY
TYPES OF The solution of an inequality consists of all
the values of the variable that make the
INEQUALITIES
inequality a true statement. The two types of
inequality are absolute and conditional.
1. Absolute Inequality. It is a condition where the inequality is true for all values of the unknown involved.
Example:
2. Conditional Inequality. It is a condition where the inequality is true for certain values of the unknown involved.
Example:
In graphing linear inequalities, we will use the intercept and the test point in identifying the solution set.
STEPS IN GRAPHING INEQUALITIES
1. Replace the inequality sign with an equal sign, and then plot the graph of the equation.
2. Select a test point lying in one of the half-planes determine by the graph and substitute the values of x
and y into the given inequality. Apply the origin whenever possible.
3. If the inequality is satisfied, the graph of the inequality includes the half-planes that contain the test
point. Otherwise, the solution includes the other half-plane not containing the test point.
LINEAR INEQUALITIES AND STEPS IN
GRAPHING
1. SKETCH THE GRAPH OF 𝒙 > 𝟓
SKETCH THE GRAPH
OF 𝟐𝒙 + 𝒚 ≤ 𝟏𝟔
1. Sketch the graph of 2𝑥 + 𝑦 ≤ 16
2. Sketch the graph of 𝑥 > 5
USING DESMOS CALCULATOR
The primary objectives
A method of dealing
of all LP models are A mathematical
with decision problems
certainty of the technique for finding the
that can be expressed
parameters and linearity best uses of an
as constrained linear
of the objective function organization’s resources.
models.
and all constraints.
Programming means
Was renamed as
It is initially referred as producing a plan or
“linear programming” in
“programming in a linear procedure that
1948 as suggested by
structure.” determines the solution
Tjalling Koopmans.
to a problem.
LINEAR PROGRAMMING
Graphical Solution Method is a two-dimensional
geometric analysis of LP problems with two
decision variables.
LP is result of Air Force research project
concerned with computing the most efficient and
economical way to distribute men, weapons and
LINEAR supply from different fronts during World War II
PROGRAMMING LP graphical solution is limited in a two-
dimensional set of axes.
Graphing software applications can be used in
three variables corresponds to planes in a
coordinate space (three-dimensional).
OBJECTIVE FUNCTION:
SUBJECT TO A NUMBER OF LINEAR
CONSTRAINTS OF THE FORM
Objective Function is an expression, which shows the relationship between the variables in the problem
and the firm’s goal.
Two Types of Constraints
1. Structural Constraint (or explicit constraint) is a limit on the availability of resources.
2. Non-negativity constraint (or implicit constraint) it restricts all the variables to zero and positive
solution.
Optimal Value is the highest (for maximization problem) or lowest value (for minimization problem) of
the objective function.
Optimal Solution is a combination of decision variable amounts that yields the best possible value of the
objective function and satisfies all the constraints.
Feasible Region is the set of combinations of values for the decision variables that satisfy the non-
negativity conditions and all the constraints simultaneously that is the allowable decisions.
Extreme point is the corner of the feasible region. It is the
location of the maximum and minimum point of the
feasible region.
OPTIMAL SOLUTION OF LP
MODEL
SAMPLE PROBLEM
A local boutique produced two designs of gowns A and B and has the following materials available:
18 square meters of cotton, 20 square meters of silk, and
5 square meters of wool.
Design A requires the following:
3 square meters of cotton,
2 square meters of silk and
1 square meter of wool.
Design B requires the following:
2 square meters of cotton,
4 square meters of silk.
I Design A sells for ₱ 1,200 and Design B for ₱ 1,600, how many of each garment should the boutique
produce to obtain the maximum amount of money?
SOLUTION :
Step 1: Represent the unknown in the problem
Let x =________________________________
y =________________________________
Step 2: Tabulate the data about the facts
Materials Design A (x) Design B (y) Available
Cotton
Silk
Wool
Profit
Step 3: Formulate the objective function and constraints by restating the information in
mathematical form (LP Model)
Objective Function: _______________________________
Subject to:
_________________________________
_________________________________
_________________________________
______________________________
Step 4: Plot the constraints of the LP problem on a graph using the intercept rule
Coordinates of the x and y intercepts:
First Constraint : ___________________
Second Constraint: ___________________
Third Constraint: ___________________
GRAPHS OF THE LP MODEL
Step 5: After identifying the feasible region of the LP, trace the extreme points of the graph and
solve for the unknown coordinated
Step 6: Solve for the intersection of the lines
Step 7: Substitute the coordinates at the extreme points on the feasible region to the objective
function
Objective Function: _______________________________
Extreme
Values of the Objective Function
Points
Step 8: Formulate the decision.
Decision ∶
𝒙 = ______________
𝒚 = ______________
P= ______________
Optimal Solution
Optimal Point