Linear

Programming- easy chapter

- Max / Min
-

S S
To find best
possible solution to a
problem
constraints-
involving

Plot

Schedule
Stay
Planning
to
Maximize Test
e
Study Marks .
.

.
g

hours 10
Lis Maximum
Study =

ii) Minimum time for matt = 4 hours

viii) Minimum time for Physics = 3 hours

The maximum value of Glox +
16y , subject to
constraints 0
, y ,
,0

Y
x +
y
= 12
,
2x +
y1z0
is objective function

(9) 144 Tbs 192 (120 Id , 240

-

I
x +
20 Feasible region
: ABCD
y 12
-
=

2x + D
20
y
=

Min
Objective func
Max (
+
12

Ed c18 , 77
always occur at

corner
point of
B
I
/
feasible
A
10 12 region
10 ,
03

PointMethoda by
12Coer
C + 2x + 20
y
=

=
x + 12
y
=

E
- x= 8 Y
y B (10 , 0) 100
=
,

< 18 , 1) 144

D20 , 127
+ max
The maximum of is 4x + constraints yx +
zy subject
2 where Z to 46 ,
zy
=
,

+ 24 and is
by =
270
x x
,

19146 # 96 (52 (d) None of these

Feasible
region A BC
:

Yx 2y 43
+
↑
=

·
2 =
yx+ zy
x+
3y =
24 (23/2 0)
A , 46

Zia
x B (24 0
yys 19 , 5)
, ,

c(9 , 5)

Fr n+
C + 2x+
y
=
23 3y =
24
yx + 46
2y =

2x +
by = 48

=>
Sy = 2s + y =
5

x =
9
 the
by subject
For the LPP , maximize 2 = x + to constraints

2y48
+
yo
+ 2 x

2y
x = x
, , ,

O ② Q
Nothing b/w D and
Common

Zmax Y (b) S
2 max
=
(a)
=

feasible
region exist
> No
-

Zmax 16 None of these

( #
=

=>
No solution will exist

·
x+
2y 2
=

>

x+ ②
2y 8
=

+
2x8
x

x+
2y = 2
 ① ② ③
For the constraints and
-y x -5
3x+
y4,3 3y = 12
2x 2x x ,
770
-

, , ,

the
objective function the minimum value of 2 is
z =

-Sox-zoy ,

(a) 300 (b) 50 160 ⑮doesn't exist

= -

Unbounded
Ziin/max exists at corner
points
-
P(x 3)
·

300
corner Points Z =
-Soc-ly
IS + 21 -

②
Feasible (1 03 ,
-

50

#
region

ine
S 16 ,
01
③
-

(0 > 3)

:
13

(0 , 5) 100
-

=
/2
Y Check if 21-300

+ 50x 300
20y
-
-

①
- 4 =
Sx
-
+
2y > 3
-

points All ④
satisfy-
constraints z -300
&
E ④
with
has common

feasible region
region
 ⑪ ②
For the constraints 2x +
y
< 3 ,
x+
zy6 ,
x
, y x0 and the
objective
function z = x+

2y ,

# Zin exists at one

point # Zmin exists at two
points

# <min exists at infinite

points & Zin does not exist

↑ Unbounded Corner Points 2 = x+

2y
① tessible
(6 , 0) >
-
2 min
region
!
(0 , 3) G
>
-

check
Check

it 2

5 2y < 6 +
↑
x+

3/2
③ No common
region bu

check ③ and feasible region

z 6
+ x +

=
zin
2
·
6
↓
=

2+ y 6
x +
zy
=
2 =
=
 E
There is cereal formed of of bran and that contains P>,
mixture nice
88g
a new a

13
6g
.

atleast of and atleast of iron that bran

protein knowing
88 36
grans my

of
contains
sog
of
protein and
young
iron
per kilogram ,
and that nice

iron
kilogram
10)
of protein and of If
loog
contains bran costs

Ig
30 .
ing per

and rice costs then the minimum of

kg
Rs Y cost
kg
Rs S
per per ,

cereal
8 (5)
this is
producing new

19 Rs 3 8
.

(Rs 4 .

2 Rs 4 6.

(d) Rs 5
.

·
Let Bran +
x Kg
straints : 88

50

E
80n + >88 0
100y
+

Rice +
y kg ①
you +
30y > 36
+
2 ② check

min
(i) Protein >,
889
x 0

1st
- yo
*
(8 9 , + 2=
88/
&
F3
in 2 Minimize
hy-
= Su +

s
* manufacturer two of and Three machines needed this
makes types toys A B for
purpose
.

are

for each
and the time (in minutes) required toy on the machines is
given below .

constraints
-
of Machine machine is available for of If the profit
Toy day
6
Type Each a maximum hours
per .
I I

toy of type
of is and that each is Rs S
,
on each
toy type A Rs L So on B
·

A 12 18 s

of of and produced
B 6 E 9 then no
toys type A B that should be to
get
The value of
maximum
profit are
respectively and
y
.

city
is

IS 130 2435 # 45
type A+ r (a)
Z
x= 15
② A(0 , 0) O Max
type is
+y const
y = 30

1504
-

↳
120 0

&
,

6 hours 2x +
y
= 60 +
0
(i) E =
C120 , 20) 250

=360 x = 20 + ② Go
2 D
d (15 , 30) Est
12x +
by
T in
,

200
an,
2x +
3y = 12 +
ii) =6 hours

I
↑

ht A
so
x
, yo
18x360

z
Bounded ①
75x +
Sy
=

(iii) #I - 6 hours
t
150 + 1 5XIS 112.5 + 150
Maximize
.

Gu+
9y
=
= 360