LINEAR PROGRAMMING

This topic starts with a refresher course in inequalities from one variable to two variables.

DEFINITION

Inequality is a mathematical statement where two expressions are not equal. The following are the
symbols that are used in inequalities.

< less than

> greater than
≤ less than or equal to
≥ greater than or equal to
≠ not equal to

Examples
Graphing One Variable

2.
Corresponding equation:
Corresponding equation:

in the inequality. Substitute to in the inequality.

; The statement is true . Statement is false.
Shade the region to the left side Shade the region to the right side of
of the line. the line.

Graph
3. 4.
Corresponding equation:
Corresponding equation :

Substitute to in the inequality. Substitute to in the inequality.

. Statement is false. . Statement is true.
Shade the region above the line.
Shade the region below the line.

Graph

Graphing two Variables

1. 2. x 0 8
Corresponding equation: y
Corresponding -3
equation: 0
x 0 -5 Pt. ( 0, -3 ) ( 8, 0 )
y -5 0
Pt. ( 0, -5 ) ( -5, 0 ) To find the Find the intercepts:
x- intercepts of
an equation,
let y = 0 then solve for x, and for the y-
intercepts, let , then solve for y.
 4.
3.
Corresponding equation:
Corresponding equation:

Intercepts: Intercepts:

and

Graph Graph

System of Inequalities
A system of linear inequalities consists of at least two linear inequalities having the
same variables. Graphing system of inequalities is finding their intercepts and the
feasible region where all constraint are satisfied. It may be bounded or unbounded.
When there is no feasible region found, then it is called infeasible or the problem has
no solution.

Graphical Solution of System of Inequalities

Below are some examples of system of inequalities applicable to linear programming
problems.
Example 1

Solution:

Intercepts:

Substitute :

, TRUE. When it is true shade the region to the left of the line
going to point ( 0, 0).
Graph

Intercepts: and

Substitute:

, FALSE. When it is false, shade the region to that side

of the line away from ( 0, 0).
Below is the final graph of the problem. The darker region is called the feasible region.
The region is bounded having three corner points such as

Example 2

Graph.
The darker region is called the feasible region bounded by Points A, B, C and D.