Date : ezoj2026

Unit: 1. LINEAR PROGRAmmINGT

PRORLEMS (LPP

Optinisation Problems: Problems of marimizing or

minimj zinq Dumerical function consisting of Several
a nunber of
variables Loith the variahles subjgct to
Constrainks CCondittons) knoon optigisation problems.

QJ ACompary sells tuoo different producs Aand 6. The ornpany makes

a profit of s 30 and ls 4o per unit on the producs Aand BresP
The too producks are Produced in a common producfoo
Process and are sold in too different mg rkes. The producHon
Company has a capacity of 850 00 roan-hours. Htakes too hours to Preo
1unit of Aand 3hours to prod. I unit of &. Maximum number of units
o hat can be sold is \2000units ahd max. of B is g00o uoit.
Formulate the problem as an LPP.
So|: Let the number of Products A and b be x1 and x2,Gven tat
|Company makes Profit of Rs 30 and Ry 40 per Unit or
the Product A and 6. Hence toteal profit
Also qiven tat too hours are needeod to produce one unit of
and ghoucs to Produce cne unit of 8 and total capacty
35000 man-hours.
Therefore

Maximum pumber f unils of A that can be 6old is

|2000 uoits
C 12000
no. of nits hat can be sold is 8000
unit6

Ral cted non- neqatie LONditioos are

5)
ainbow
 Date :
Required
Max z -
30X1 + 40 X2
Subject to Constraints

and hon
heqativity CorcitHons

Q2. AHro
produces tree prod A,6, and C. lhe prcit are ls 3, 2 &4 resp.
lhe firo has too
machines MI and M2 and the req uired ProcessIng fime
oinutes or each machine on each producf is alven belo)-
Machine A
Pro duct
B
4 2
M2 2 4
Machiryes MI and M have 2000 and 2506 machie minutes
respectively. The fm oust manufacture at least (o0 As,200 8s
ard So Cs but ot roore than 15o As.for
oulete
to aximize profit

Bol; Requined is
2X2
Subject to constraints
4x1 + 5x3
202 + 4x3

X2 200

Non - negativity onditions

Rainbow
 GRAPHICAL MErHOD Date :

. Max Z: 5x + 312 cbjecttve Function

|Subject to Consthaints
Constrainis
511 + 202 l0
DOn- Degatiity corditions

Consider the Conshaicts 0s equalities and draw straight lines

3x1 + 52
ot5C 2 = (5

Similarly |: 5

Hence for(1) {ai): o,3) (5,3

X 2
Hence for ) (o,6) (2,9i

Thiee important
tninqs ohie
ploting gtaph :
Area tounded by both lines o

Dlo
Direciorn of arouo maft
9

sOny Consider guadart

2 4 6
Ao,o) 820

-2

1 .f1 ainbow
 Date :
Smutananeous 6olvina f eq uatioos
3%I 45x2 - 15
51 t 2%2 lo ) 5
substitytinq in e g )

-l5
3X1 + 5X2 15
15 ’ 60t52e
3x 20 4 572 =

15 - 60 2 85-60, 572
5X2
20
(9

T2 45
(9 |9

Maximiv at points
S2 + 3x2 5(0) + 3(0) o
Z8: 5(2) + 3(0) : 16
12.36
Zc: 235 =
(9

5(o) + 3(3)

52| t 322 = |2-36

Max Zc
X2 : 45
obere C|= 20

q.2) Moxinise
(ongrqins XtX) 450

non negainity Condiiens

DC| X2 450
Jhe oondirates ae

Rainbou
 Date :
Sirnilarly fee eqn

Jhe cortingtes xij: (o,60o) (300,o)}

200

AO,o)

3001

Simultanxous Bolrlng of quations: X|+X2: 45o

2x| + 2 600 150+x, 50

X2: y50- 150
C23oo

150
ZA: 3x1 + 42 )
=q0
3(150) + 4(300) 450 +1200 ’ (650

Zo: 3(0) + 4(450) I800

Maximize at Zo 32+41 18DO

Lohere xo
uinbou
 Solve
Max z.
Date:
Sub to consraints:

*1,2 20
Let XI 42x2 2I+N2 12 2
20

2e12
22= O
Jhe coOrdinates are Jhe coordinates are
)(30)}

D(o6)

2,0
64 (6 18
82,6)

Simutaneous Maximum value Marz= 2|t272

I/+22 = 20
t 2 = l2.
2)+ 2(0): 12
I4+ 2(e): 20
22-8 20=i(o) + 2(6)= 20
Moximize at two points Card D
t8 =12 wbere at C
at D |: o

Maximum value of Z 20
Rainbow
 2: 40 Date :
Maximize t 35 4
|Subjeci to Constraints: 2x t 3y 6o
4x + <q6
non- negative conditions
ol" inequatities to equations q6

XFoy 20 32

Coordinates eqo ae Coordinates ere

Scale
lCm= IouniHs

D(o,20)
to

Ao,o) 84)

Simultanecus 8Alving
Moimum value ez
q6 Max z: 40% t
354
-222 - 36 ZA= 40 (o) t 95 (o) =
t 2
18 ZB= Ao(24)t 35(0): 460

20 35(20)- 700
60 Jhe maxium value of Z is (oo0
a(18) 1y"¢o 34 24 at C wbere
36 139-60
Bainbow