Beruflich Dokumente
Kultur Dokumente
com
For any question mail us at info@pakturkmaths.com
Composed by Engin Batrk
TYPE
Notes
CLASS
XII
No
(greater than), (greater than or equal to) are used to write inequalities.
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.
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
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
ax by c
a 0, b 0
Step-I
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
c
ax by c intersects x-axis at point A , 0
a
Put x 0
0 by c x
c
b
c
ax by c intersects y-axis at point B 0,
b
Step-IV
Step-V
Next consider a point, called the test point, not lying on the line
Step-VI
ax by c
solution region of the inequality and we shade some of the solution of region
Step-VII
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
a1 x b1 y c1 and a2 x b2 y c2
Step-I
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
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
c
a1 x b1 y c1 intersects y-axis at point B 0, 1
b1
Step-III
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
solution region of the inequality and we shade some of the solution of region
Step-VI
Step-VII
Put
y 0 in a2 x b2 y c2 to get
a2 x 0 c2 x
c2
a2
a2 x b2 y c2 to get
0 b2 y c2 x
c2
b2
c
a2 x b2 y c2 intersects y-axis at point D 0, 2
b2
Step-VIII
Step-IX
Next consider a point, called the test point, not lying on the line
Step-X
a2 x b2 y c2
solution region of the inequality and we shade some of the solution of region
Step-VI
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
pakturkmaths.com | Success is a ladder you cannot climb with your hands in your pockets
A point of a solution region where two of its boundary lines intersect is called a corner point or
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
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
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:
Optimal Solution:
The feasible solution which maximises or minimises the objective function is called the optimal solution
The theorem of linear programming states that the maximum and minimum values of
Graph the solution set of linear inequality constrints to determine the feasible region
Step-II
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