Linear Inequalities in two variables

A solution of a linear inequality in two variables is a set of points

which satisfies the inequality. Graphically, It is a region in the XY
plane.
For < or > inequalities we use a dashed line. For
inequalities we use a solid line.

A solid line is included in the solution, a dashed line is not.

To solve a linear inequality graphically, We will sketch the line
corresponding to the equation and then strike out the points we
do not need.
GRAPHICAL SOLUTIONS OF LINEAR INEQUALITIES
1. Solve

y 10 ;

Sketch the line y = 10 in the XY plane. Shade the region we not

not need.

For inequalities of > or < form, we used dotted lines to sketch.

The points on the dotted line are NOT part of the solution.

2. Solve the inequality 2 (2 x y ) <2 ( x+ y )4

4 x 2 y <2 x+ 2 y + 4

4 x 4 y <2 x4

x
y > +1
2

Sketch y x/2 +1=0 as a dotted line. Strike out the region below
the line.

Is ( 0,2) a solution?
Is (1,2) a solution?
Is ( 6,2) a solution?
Verify mathematically or see the graph!!!

Solve the following system of inequalities graphically, and clearly indicate the feasible region:
Q.1 x-y>4, x<2,y>-5
>

>
>
Solve the following system of inequalities graphically, and clearly indicate the feasible region:
Q.2
x+y4, 0 y, 0x,3x+y6
>

>
>

Is ( 0,2) a solution?
Is (1,2) a solution?
Is ( 6,2) a solution?
Verify mathematically or see the graph!!!

Solving systems of inequalities.

Sketch the line corresponding to each inequality separately and
strike out the region we do not need.

x +10
{ y 2
y x2

Line 1: y = -2x + 10.

We require the region above the line!
Line 2: y = x-2.
We require the region above the line!
Any point lying in the unshaded region along with the borders will
satisfy both inequalities.

Application: A firm manufactures two products. The

products must be processed through one department.
Product A requires 4 hiours per unit, product B requires 2
hours per unit. The production time available in the
coming week is 60 hours.
Set up the linear inequality for this restriction.

Let x = total no. of units produced of product A

Y = total no. of units produced of product B
Total hours in production cannot exceed 60. So
2 x + 4 y 60

Since x and y are production levels, we have

x 0, y 0.

Graphical Solution for

2 x + 4 y 60

, x 0, y 0.

1
y= ( 602 x )
4

We need the region lying below this line:

Also only consider the first quadrant as production levels cannot
be negative.

Suppose the products need to be processed through

another department also. If A requires 3 hours per unit
and B requires 5 hours per unit and there are a total of 75
hours available, set up the inequality describing this and
sketch the solution on the same graph.

3 x+5 y 75

Solution is the area ABCD.

Each point in this region gives a combination of the two products
which can be produced.

Points to think about:

Do points on AB satisfy the solution.

On BC??

Why are combinations in the triangle AEB not possible?

Why are combinations in the triangle BCF not possible?

Objective: If each unit of x costs $5 and each unit pf y

costs $6, formulate the objevtive function which will
maximize profit.

Maximize z = 5x + 6y
The objective is to see the feasible solution which will give a
maximum possible profit.

The LP model for this problem is:

Maximize z = 5x + 6y
Subject to
2 x + 4 y 60
3 x+5 y 75

x0

, y 0.

Linear Programming
This is a mathematical optimization technique, where we try to
maximize or minimize some objective. The most common
application of LP is allocating limited resources among competing
activities in a best possible way i.e. the optimal way. The adjective
linear means that all the mathematical functions in this model are
required to be linear functions.
Decision variables: These are the variables for which certain
decisions need to be made in order to achieve our objective.
Objective Function: Function to be maximized or minimized

Constraints: Restricitons/Conditions applied on our decision

variables are called constraints.

Feasible Points: The set of all solutions to the system of linear

constraints are feasible points. There could be infinitely many
feasible points.
Feasible Region: The set of all feasible points is called the feasible
region.

Nonnegativity Constraint: Every LP practical optimization problem

has this constraint which says that the variables cannot be
negative.