Sie sind auf Seite 1von 4

For more news and updates visit pakturkmaths.

com
For any question mail us at info@pakturkmaths.com
Composed by Engin Batrk
TYPE

Notes

05: LINEAR INWQUALITIES & LINEAR PROGRAMING

CLASS

XII

No

LINEAR INEQUALITIES & THEIR GRAPHS


An inequality expresses the relative order of two mathematical expressions. The symbols
to),

(less than), (less than or equal

(greater than), (greater than or equal to) are used to write inequalities.

Note-1: The sign of an inequality is unchanged if it is multiplied or divided by a poistive number.


Note-2: The order of an inequality is reversed if it is multiplied or divided by a negative number.
Linear Inequalities in One Variable:

Inequalities of the form

ax b 0 , ax b 0 , ax b 0 and ax b 0 ,

where ax b 0 are constants, are called the linear inequalties in one variable
Compound Inequality:

A compound inequality is formed by joining two inequalities with a connective word such as

and or or
Example:

x 2 and x 8 24
x 2 or x 8 24

Solution of Linear Inequality:

The real numbers

x 2 which satisfy the linear inequality in one variable x 2 form is

solution.
For example, the set of all real numbers which are greater than 3 is a solution of inequality x 3 . The graph of the solution of
this inequality is given below

Linear Inequalities in Two Variables:

Inequalities of the form

ax by c , ax by c , ax by c and

ax by c , where ax b c are constants, are called the linear inequalties in one variable
Graphing the Solution Region of Linear Inequality in Two Variables:
where

Consider the linear inequality

ax by c

a 0, b 0

Folowing are essential steps in graphing the solution region of inequality

Step-I

First consider the equation of straight line corresponding to inequality

ax by c
Step-II

Put

y 0 to get

ax 0 c x

c
a

pakturkmaths.com | Success is a ladder you cannot climb with your hands in your pockets

This shows that the line


Step-III

c
ax by c intersects x-axis at point A , 0
a

Put x 0

0 by c x

c
b

This shows that the line

c
ax by c intersects y-axis at point B 0,
b

Step-IV

Next draw the line joining the points A and B

Step-V

Next consider a point, called the test point, not lying on the line

Step-VI

If the test point satisfies the inequality

ax by c

ax by c , then the region containing the test point must be the

solution region of the inequality and we shade some of the solution of region
Step-VII

If the test point does not satisfy the inequality

ax by c , then the region containing the test point is not

the solution region of the inequlaity

Graphing the Solution Region of System of Two Linear Inequalities in Two Variables: Consider the linear
inequalities

a1 x b1 y c1 and a2 x b2 y c2 where a1 0 , b1 0 , a2 0 , b2 0

Folowing are essential steps in graphing the solution region of inequalities

a1 x b1 y c1 and a2 x b2 y c2
Step-I

First consider the equation of straight lines corresponding to inequalities

a1 x b1 y c1 and a2 x b2 y c2
Step-II

Put

y 0 in a1 x b1 y c1 to get

a1 x 0 c1 x

c1
a1

This shows that the line


Put x 0 in

c
a1 x b1 y c1 intersects x-axis at point A 1 , 0
a1

a2 x b2 y c2 to get

0 b1 y c1 x

c1
b1

This shows that the line

c
a1 x b1 y c1 intersects y-axis at point B 0, 1
b1

Step-III

Next draw the line joining the points A and B

Step-IV

Next consider a point, called the test point, not lying on the line

a1 x b1 y c1

pakturkmaths.com | Success is a ladder you cannot climb with your hands in your pockets

Step-V

If the test point satisfies the inequality

a1 x b1 y c1 , then the region containing the test point must be the

solution region of the inequality and we shade some of the solution of region
Step-VI

If the test point does not satisfy the inequality

a1 x b1 y c1 , then the region containing the test point is not

the solution region of the inequlaity

Step-VII

Put

y 0 in a2 x b2 y c2 to get

a2 x 0 c2 x

c2
a2

This shows that the line


Put x 0 in

a2 x b2 y c2 intersects x-axis at point C 2 , 0


a2

a2 x b2 y c2 to get

0 b2 y c2 x

c2
b2

This shows that the line

c
a2 x b2 y c2 intersects y-axis at point D 0, 2
b2

Step-VIII

Next draw the line joining the points C and D

Step-IX

Next consider a point, called the test point, not lying on the line

Step-X

If the test point satisfies the inequality

a2 x b2 y c2

a2 x b2 y c2 , then the region containing the test point must be the

solution region of the inequality and we shade some of the solution of region
Step-VI

If the test point does not satisfy the inequality

a2 x b2 y c2 , then the region containing the test point is not

the solution region of the inequlaity


Step-XII

Finaly, we shade the common solution region of both inequalities a1 x b1 y c1 and

a2 x b2 y c2

Graphing the Solution Region of System of Three Linear Inequalities in Two Variables:
The graph the solution region of a system of three linear inequalities

a1 x b1 y c1
a2 x b2 y c2
a3 x b3 y c3
Where

a1 0, b1 0, a2 0, b2 0, a3 0, b3 0, we follow the same steps as we used for the system of two linear

equations

FEASIBLE SOLUTION SET

pakturkmaths.com | Success is a ladder you cannot climb with your hands in your pockets

Corner Point or Vertex:

A point of a solution region where two of its boundary lines intersect is called a corner point or

vertex of the solution region


Problem Constraint: In a certain problem from everyday life each inequality concerning the problem is called the problem
constraint
Nonnegative constraints or decision variables:

The variables used in the system of linear inequalities relating to the

problems of everyday life are nonnegative and we called nonnegative constraints or decision variables
Feasible Region:

The solution region of an inequality restricted to the first quadrant is called the feasible region. In this

case both x and y are always nonnegative, i.e.

x 0, y 0

Feasible Solution:

Each point of the feasible region is called the feasible solution of the system of linear inequalities

Convex Region:

If the line segment joining any two points of a certain region lies entirely within the region, then such

a region is called the convex region

LINEAR PROGRAMING

Linear Programming: The mathematical technique which deals with the problems to get optimisation (maximisation or
minimisation) of a linear function of variables is called linear programming
Objective Function:

A function which is to be maximised or minimised is called objective function

Optimal Solution:

The feasible solution which maximises or minimises the objective function is called the optimal solution

Theorem of Linear Programming:

The theorem of linear programming states that the maximum and minimum values of

the objective functions occur at corner points of the feasible region


Steps to Find Optimal Solution:
Step-I

Graph the solution set of linear inequality constrints to determine the feasible region

Step-II

Find the corner points of the feasible region

Step-III

Evaluate the objective function at each corner point to find the optimal solution

pakturkmaths.com | Success is a ladder you cannot climb with your hands in your pockets

Das könnte Ihnen auch gefallen