CHAPTER 5 LINEAR INEQUALITIES & LINEAR /48

PROGRAMMING

Linear Inequalities and

Linear Programming

inequalities

Inequalities are of four types:

26 Inequality
Greater than
|
| Less than
il ‘ Greater than or equal to “
Less than or equal to |

Linear Inequalities

Generally a linear inequality in two variables x & y can

following four forms: be one of the
(i). ax+by<c
(ii). ax+by<e
; (ili). ax+by>c
| (iv) “ax +by 2c. where abe are constants also a, b can not zero
H ; simultaneously.

Some Important Results Related To Line

ar Inequality In Two Variables:

(a) ax+bhy =c is called associated or corr

esponding equation of
any of the above four linear inequalities.
(b) é
Every inequality divides a plane into two
half planes. |
(c) A vertical line divides the plane into left
and righthalf —— |
planes.
4 (d) A non-vertical line divides the plane into upperand lower _|
| half planes. 5
| (e) Ifan inequality involves <or > ,the
half plane is open. ares
| (f) If an in equality involves < or > th
e half plane is closed.
(g) A point of a solution region where tw
o of its boun dary lines
intersect is called'a corner point or vert
ex.

KIPS ENTRY TEST SERIES

 CHAPTER 5 LINEAR INEQUALITIES & LINEAR /49
SIPS
PROGRAMMING

Procedure for Graphing a Linear Inequality in Two Variables:

(i).Graph the corresponding equation ax
+ by =c .used a dashed line for this
line in the < or > cases, and a solid line in the < or = cases.
(ii). The solution set is the half plane on one side of the boundary line. To
determine which side, choose a test point (any point in the plane but not
on the line) and check to see if the coordinates of the point satisfy the
given inequality.

Linear Programming

Linear programming is a branch of mathematics that deals with an important class

of constrained optimization problems.

Some terms related to linear programming;

Problem constraints The system of linear

inequalities involved in the
problem concerned ts called
problem constraints.
Decision variables © Non-negative constraints are
called decision variables. _
Feasible region A restricted region under certain
| constraints is called the feasible
a
Feasible solution |. Each point of the feasible region
= : is called feasible solution. ~~
Feasible solution set —_ The set of all feasible solutions
of a system of linear inequalities
is called feasible solution set.
Convex region If the line joining any two
points of a region lies entirely
with in the region, then the
region is called convex.( see
Se —— __| figures at the end)
‘| Objective function A function which is to be
maximized or minimized but
not both is called objective
function. ae
Optimal solution The feasible solution which
maximizes or minimizes the
objective function is called
Ss = L optimal solution. sue a ee
=

“ Introduced by a Soviet Mathematician Leonid Kantrovich in 1930’s.

KIPS ENTRY TEST SERIES |

 ¥ rg
Y
CHAPTER 5 LINEAR INEQUALITIES & LINEAR /50
=. PROGRAMMING
— -__—_—_—_—_—_——————— ee
Procedure for Determining Optimal Solution:

(i).Graph the solution set of linear inequality constraints to determine the

feasible region.
(ii).Find the corner points of the region.
(iii)Evaluate the objective function at each corner point to find the optimal
solution.

Points to Be Remember

There are infinite many feasible solutions in the feasible region.

OO

The intersection point of two boundary lines is a corner point only

if it is feasible.
Q Ifa linear program has an optimal solution, it must occur at a
comer point of the feasibility region.

Convex Regions

Fo Wye
These regions are not convex

KIPS ENTRY TEST SERIES |.

 LINEAR INEQUALITIES & LINEAR
/51
eee PROGRAMMING
ee ae

(1) A function which is to be maximized or

minimized is called ser is Se
function
(a) Optimal (b) feasible
(c) objective (d) corner
(2) The feasible solution which maximiz
es or minimizes the objective
function is called
(a) Feasible solution » (b) optimal solution
(c) either feasible or optimal (d) none
of these
(3) Non-negative constraints help in taking
(a) Solutions (b) maximization
(c) minimization (d) decision
(4) Optimize means a quantity under certain constraints
(a) Maximize (b) minimize
(c) either maximize or minimize (d)
both
(5) Inequalities have symbols
(a) 2 (b) 3
(c) 4 (d) 6
(6) The solution set of x<4 is
(a) -00<x<4 (b) 4<x<oo
(c) 0<x<4 (d) -200<x<oo
(7) Which one is an associated equation of
axt+by<c?
(a) axtby<c (b) axt+by<c
(c) axt+by-c<0 (d) axt+by-c=o
(8) Corner point is also called
(a) Origin (b) focus
(c) vertex

(b) real numbers

. (c) non-ve integers (d) none of these
(10) Non-ve constraints are called
variables.
(a) Discrete (b) continuous
(c) dependent (d) decision
(11) There are _ feasible solutions in the feasible region.
(a) 2 (b) 4
(c) 6 (d) infinite.
2) When f(x,y)=x+3y is maximize, subj
ect to 2x+5y<30, 5x+4y<20, x>0,
y20 the maximum value of f(x,y) is
(a) (0,0) (b) (0,5)
(c) (5,0) (d) (5,5)

KIPS ENTRY TEST SERIES |

 x< 2a we a
5 LINEAR INEQUALITIES & LINEAR /52
CHAPTER
PROGRAMMING
KIPS

bj ec t to x+ y2 >3 , 7x +5 y< 35 , x2 0, y> 0 th en H is

(13) If H=2x+y is minimize, su
maximum at
(a) (0,0) (b) (3,0)
(c) (0,3) (d) 3,3)
the lin e x+ 2y =4 sa ti sf y the in eq ua li ty ,
(14) The points above
(a) xt2y<4 (b) xt+2y<4
(c) x+2y>4 (d) xt+2y>4
(15) The graph of fe as ib il it y re gi on of 3x -y <2 an d x+ y2 6 is

(b)

(16)

Is the feasible region of

(a) 2x-y>5, 3x+y>0, x<4 (b) 2x-y>5, 3x+y20, x<4
(c) 2x-y>5, 3x+y>0, x<4 (d) 2x-y>5, 3x+y>0, x<4

KIPS ENTRY TEST SERIES

 LINEAR INEQUALITIES & LINEAR /53
PROGRAMMING

117) The graph of x-2y<6, 2x+y22 and xt2y<l0is 4s

(b)

(d)

“om
(18) Which of the following is not convex?

®) at Ee

(19)
=
A manufacturer makes two gr ad es of co nc re te . Ea ch ba g
wh
of
il
the
e ea
hi
ch
gh -g
bag
ra de
of
concrete contains 10Kg of gravel and 5K g of ce me nt ,
of gra vel an d 3K g of ce me nt . Th er e are
low-grade concrete-contains 12Kg
of ce me nt cu rr en tl y ava ila ble . Th e
1,920 Kg of gravel and 780Kg
a pro fit of $1 .2 0 of ea ch ba g of the hi gh gr ad e and
manufacturer can make
gr ad e con cre te. Th en the nu mb er of ba gs of lo w
$ 1.00 on each bag of low
grade, high grade an d the ma xi mu m pro fit are re sp ec ti ve ly ?
(a) 60,120,240 (b) 12 0, 60 ,2 40 (c) 60 ,1 20 ,2 04 (d) 12 0, 60 ,2 04
value-of F=3x+4y subject to x+3y<15,
(20) The largest and smallest
4x+3y<24, x,y20 are__ respectively
(a) 25,5 (b) 5,0 (6) 25.10 (d) 25.0.

KIPS ENTRY TEST SERIES

CHAPTER 6 CONIC SECTION/ 54

Conic Section

Ellipse Hyperbola

KIPS ENTRY TEST SERIES |