Tutorial 1

Formulation of Linear Programming

Problem (LPP) and Graphical
method

Date of the Session:

Learning outcomes:

" Understanding the process of formulating a given problem in linear form.

" This requires defining the decision variables of the problenn, establishing inter-relationship
between them and formulating the objective function and constraints.
" Understanding the process of solving a given LPP using graphs will be discussed.

1.1 PRE-TUTORIAL

1. What is Linear Programmiung Problem (LPP)?

Linear Progvamning Problem (LPr) is a mathegascol bechniqye cwhich is used to

oplimize(a~imi2e or minimíe]the chiective furnction ith the limited vesourCes

2. Define the following terminology in LPP:

(a) Objective function
(b) Constraints
7
Mathenatical PogamminK TUTORIAL I IOR\MULATION OL PP

(c) Deisiou Niables

(d) Nou-Ngativity Conditions

a)objective Function: The Funckon that needs to be opimízed.

(rlaximized or Minimized)
E-axtby
b) Constraints: These ave the liceay Tnegvalities or eouaions that resbict the vahe of
Decision Vaviables

)Decison Vaviables: The Vaviables which e take in LPP pvoblem to take the Decision

) Non-negativity Consbraints: The Decison variables ahichave greater than or equal

to Bevo or non-neqetie vaes

3. Enumerate the steps involved in Formulation of LPP.

The proceduve for mathematical formulation of a linecy pragramning problem

Consists of Bhe follouy steps.
4Identify the desion Variables
a- Tdentify the chjective funchigoto be maximized o minimi ~ed ard express it as a
ineav funlin of decisjen variables
3.Identify thaset of constraint conditions andexpress them as linear inegualibies
or equahons in terms of the decsion vaviables.
atheuatical Prograng TUTORIAL 1 FOR\IULATION OF LIP

I Whh tvpe of L PP can b old ushg gtaplucal uthod'

The Graphical Method for soling bnear Proqvamming Acblems (L) Can only be usd
wben the problem invlues buo decisicn yable5- This method is pavticwarly
efective for visalisig theaiole region, cornsbrants and the cbjectve functicn

h n eLma k s h
Mathematical Proguig TUTORIAL J JORMOLAON O LPP

1.2 IN-TUTORIAL

pnts (1 mit) ne 2n' ol silk d lurot cotlon Ev jcket leod- I j' ototton d
pants and jacketsthat the ntacuuer mst give to the otel so that thes ites obtan
: x u sal? Fmulate tle poblem g :theatical od e o LPP fur the
objcctive function?
Solution:

)Decision Variables: Let and x, dencte the nunbey of pants ond number of
jackets vespectively
i) objective Funchion:
Profit on X, pants =S0x,
Profit on Z jackets= t0
Let z= SOx + t0xy which is the objscbiae
funclion
Manz= S0x, t tox

i) Consbraints:
We make the follouoirng table fom given data
Iten
n
Pents
L a k s i Jackets Availabiliby
1000
Silk
750
15

50 40
Pice
I000

i) Non-negptke Resbictions:
Snz Sox, +9ox
Subject to 8x, tXSlooo
Consbraints 10

Decision
Vaviables
Mathennatical Progranminz IUTORAL I FOR\IULAUON OT LPP

2. Atransport compun ln tho Npes of tncks. Tvpe Aand Type B Type Ahas e1 yetrd
capacity of 2 0 datlot-ehigvtdcaparity of 0n' while Type Bhas rergatda
pacity of 30andw-etugeated capacity of M Agocer evds to lirck ton tle
traisport of 3000of ebgeated stock and 0ot oeigeratel stock Te t p
kilometer of aTvpe A is $3)and $I0 for Type B How manv trucks of each tvpe hond he
grocer rent to alieve the minimun total cost Formulate the problem sng matheulalical
modeling of LPP and dene the objective fuxtion
Solution:
ypeA and Xa be the trcks of
) Decision Vaviables : Let x be the tucks of
Type B
Ö) ohjecive funcion:
Cost per kilcmeter of x, ype-A Tucks = 30
Cost pex kilbmete of Tupe-B Trocks =40
objective funchion
Let z-3o x, + tox,, which is the
Min z=3ox,+ 40a

Type-A Type-B
3000
Yef 30

non-vef
ii) Conditions:

i) Non-'eqative Resbiclions:
Min Z-30x +40
Subject to constaints:
dox +3o >B00o

11
Mathematical Programming TUTORIAL I FOR\MULAION ) LPP

3. A hotel las requested a mamrctuer to produce pillows ad blaukets fon then 00LMV
For materials, the manutactuuer has 75b' of cotton textile ad 1000m' of silk Evey pillow
es 22 of cotton and Im' of silk. Eery blauket necds 2)' of cottonad 'of silk
The price of the pillow is fixed at $5 dthe blnke is fixed at $10 WLt i the nunbe of
Dillows and blankets that the mutacuer ust gie to te lotclso that theeiteU obtan
a axinnumsale? Fornnulate and Solve sing Python.
Solution:

Let ,be pillows and be blankets

Pillows Blankets
750
Cotton
Max z 5,+ l0Ma
(O00
Silk

The ohjective funcion; maN 5xt l9ya

Subject to constraints:aytax< so9
X + Sxgs lo00

K o n e
L r u
a k s t l e h

12
Mathenatical Programming TUTORIAL I FORMULATION OF LPP

1 Au Industrv makes two ites of P and Q ly using two devies Xand Y Prosg ti
requies 5) lirs on item P on device Xand 30 bus evquies on dlevice Y Pronsng t
requires 21lns fon item Qondevice Xad 33 hrs reyuires on device Y A stautng of tlu
current wek. 30 piso ! d90 pics of B are available ProossilIg tinet t alble
on device X pedict to be 0 hrs and on device Y is pdict to be 35 hrs. DeLd for P'
in the curent woek is predict to be 75 pieces and for Q is predict to be 93 piees Itustrv
policy is to naximize the combined sunof the pieces of P and the picces of Q in stock at the
end of the week Fornulate the problen of deciding how much of cach item to uake n the
curent wek as alinear prugran1. Obtain the solution Ising graphical method.
Solution.
P
X:P
33 35

Max XPy

Sox t y < to

30x+33y 35
2<30
Y<90
o

275
30 x |so0x + 7a0y = lao0
y>95
ISoo XtI6Soy 17so
99oy 550

X=0

A ’ ) ’/
B’ (o-6,0s)’1-t(mas)

The point P(o6ro-5) has maximum volbe

14
\lathematical Progrmning TUTORLAL L FORMULATION OL P

J. Consider the following hen pogammmg poblem

\Mxim P=7r 12u

3r 7y 12

Obtain the solution usiug gaphical niethod

Solution:

Max P=+lay

3x+7y <ta

3x+7y 1a

3xO

5y >6
y-1-a)

15
 16
hL
o au
k eru
aa-8 value
ofmaxirnum B(a)
has point The
&|C’
8a-8(ax) B’
A’1a ave values Max
C’3,)
(o) A
6
FOR\ULATON
LPI' OF TUTORUALI Prograning \lathematical
latlhenatical Proganuing TUTORAL I FOR\1GLATON OF LPP

.3 POST-TUTORIAL

I IWhat ae the Adaut ages of Lwa Pogaig Pollem'

Solution

inear Proqramming Roblems (uPP) opbimi~e the allocabion of limited vesouYCeS,

heping bo Maximíze profit or minimize Costs- PP Suppovts informed decision -
making through quantitative analysis to aceess the iohpact of changes

2. Applications of Linear Programning.

Solution:

Engineering Thdosbies :
Engineering Industies use lineav programming to sove design and monufackunng
Problems and to get the maximom output fom agiven condition

lonufactuing Indusbies:
Trdusbies 0se lineav progranmito maximi ze the profit of
Manufactoing
cost
the Companies and to veduce the manufpetoing
Energy Indusbies
to optinize their produchion output
Energy cermponicssose linear progranming
Transpotatiog trdusties:
proqgramning is also used in transportatien industbies to find the pal
Line
bransportobion
to minirnize the costcf

17
Mathematical Progtaning TUTORLAL I FOR\MULATION OF LPP

3 AconaN oWns two flour nulls viz A dB. whh hve btlerent produton cjpauti
for lhigh. ehum ad low-qualhty flour The oup b Cntercd a ontD o spplv
flou to ahn everv month with at least 8. 12 and 2Lqutals ol bigh. nebum al o
qualitveivel Itcosts the company Rs 2000 and R 1300 er dayto uD A t B
respetivel On adav. Mill Aproduces 6. 2aud Iquntah of higb. eeliunn ad ow- yuabtv
tBou \hill Bpodes 2. 4and 12 quintas of lbig. uwund low-uadity tlouy epwnely
How may days peT Month should each mill be operated in oder to meet the contact orde
most cc0nomicallv? Formmulate the LPP.
Solution

Step1:Decision Variables
Xbe thenocf doys NAis operatud permonth
y be the novof days MillB is operated per month
Step B: Ohjective function
Total cost of oper ting (lilA, ill8
Mino00x +|500y
Sbep3:Subject to constrcints
High Quality Fbor: 6xtoy>8
Medium yolty ax+y>la

Btep LPP
Minz000x +ISo0y
Sobject to:
6x+ ay >

41ay >a9
here X20, Yo

18
latenatical 'ogming TUTORIAL I FORNULATION 0F LIP

1 An advwtig compn plaIs is nltisng strategy in thure leet e e treten

dw ud gazins. Following dta have bwen obtained hol uket sUey
Teleisiom Radio
\Lagazi
Cost of al advertising Rs. 30.000 Rs. 20.000 Rs. 13.000 Rs 10000
No. of potential cUs
tomers Iched per 2.00.0000 6.00,000 1.50.000 I.00.000

No. of feuale cUs

1,50,000 4,00,000 70.000 30.000
toniers reached per
unit.

Following are the set of

pany wants to spend no more than Rs. 4,50,000 on advertising.
requirenents that must be met:
(a) At least millionexposures take place among female customers.

(b) Advertising on nagazines be limited to Rs. 1,50,000.

should each be between 5 and
(c) The number of advertising units on television and radio
10.
Formulate the LPP.
Solution:

Step 1: Decisian Vayiables

televisin
x be the no-ef advertisirg units on
on Yadio:
y be the no of advextising units
Z be the no of aetising nits in magazhe1.
'advertising units in magazine &
styp a objeckiyefonetion
Max~ aoo000x t 6o0000 yt IS000o~ +loo000 B
stop3!Consbraints
Budget:

Female custoreekpasUre'
lso000 X+ L20,000t ty000~ +So, o00 Ea >jog,000
Mathemat ical Progaming TUTORIAL. I FORMULATION OF LPP

Hagazine adget

Non- negativity consbaints, Nb of advertising units

5<x<Io, S<y<lo
y , Zao

Step 4: LPP
iax z = oo,000x+6,00, 000yts9000Z t,00, 000Ea
Subject to :

5X<lo, 5<y <lo

Non-regatve Constaints
K
4, , Ba
o u e
L r u
a k

20
latbenatical Pogunming TUORIAL I FORMOLATION OF LP

3A cabinet ake nakes benchesad desks Eh beh cn be sold lo poht ol S 0

ah dosk for a potit of $0 The cabncuuke tll tford to spe p to 0 s pe wrk
wOrking ad takes 6 lus to ake a bend ad 3 us to make alesk Cstoner demal
uuch stoage spaCes desks and thee is ooulo t 0 fouu bences r h week Iopnlte
this problen as a linea progranivg problem ad olve it gupbicall
olution

Step1: Decision Vaviables

x:be theDUrber of benches to be produced per week
4:be the number of desks to be produced per coeek.

Step a:dhjective Functicn

Max t 30xtloy
Step3: Consbaints
Time :
6xt3y <t0
Denond:
Y>3x

Storoge

Nan -nogotive Constroint:

Step 4: Pp
Maxt3ox+loy
Sokject to:
s+3y <to’l
21
3*-y09 Y>3
4xty<4’z
AMathenatical Programmng TUTORIAL I FORMULATION OF LPP

Pts ave

4 (a.), (o) Io

A-(»9),8-(0),c-to9)
(oo) 30(0)t/o(o) =o
3

3o(o) +io4)- 40

( ' ) 3o(9) (%)o34a1 23 4S 6 8

Optimum Sol":x=0 y=t

optimum vavei Z=30x+ loy

Z=40

For Evaluator's Use only

Evaluator's Observation
Evaluator Comments
Marks Secured ub. out of 50

Ful Name of the Efalyator:

Signature of thg Evaluator:

Date of Evaluation:

22
 Tutorial 2

Simplex method and Principle of

Duality
Date of the Session:

Learning outcomes:

" Understanding the key terms: feasible solution, feasible regjon and optinal solutim.

Understanding the limitatious of graphical metho and introduce the Sinplex alyorithn.
" Understand that an LPP consists of more unber of constraints as compared to mumber of
decision variables.

" Understanding the computational procedure can be considerably reduced by convertáng the
LPP into a form called as Dä¬= and then solving it.
a k s i

2.1 PRE-TUTOR0AL
1. Which type ofLP.P. can be solved using Simplex method?
A) Dinear
11) Decision Vaviables
iúi) Egpality Constraints
iv) Feasible Stontirg foint
v)Bounded easibe Region
vi) Nenpegative Consbaints
23
Mathematical Progamng TUTORIAL 2 SOLVING LPP

2. What do vou neau by fesible egon. fesibe solution doptiul onton'

i) Feasible Regicn means also knoun as the feasi ble setj is the setof all
Poseible Cormbinations cf values for decisian vaviobles that satishy ol
of proolems Consbaints
i) Feasible Solulin meons isa specificsel of values for decision vajables
that satisfies all the constaints cf thé lineav prograramnirg problem, it
is a point
ii) optimatSolotion reans bhe best possible solution within the feasible vegion,
as detmined by the ohj function.

primal?
3. State the general rules for formulating a dual LPP from its

DRrimal Pcblem
ii Duad Variables
i) Dual PF
i) Dual Consbthts
y Dual Cehsbaints computed variables
vi) ConpkteDial ceprcblem

24
Alenaical 'hong |UTORIAL 2 SOL\IVG LP

2.2 IN-TUTORIAL
|Consde He tollow lem ptogamg polblem
P

12y

3r+7y <12

Set up the imitial Simplex Tableau and obtain the olution.

Solution:

Let Si, Sa Cne Slack Varíables

becomes,
Max P7+ lay + 051+ 05a
5ubject to constraints:
Qx+t 3y + S1t05, - 6
3x +7y to51t S la
where
K o n e
L rauk s h i t i

25
\lathcuatical Progtanmg TUTORIAL 2 SOLVIVG LPP

Initial Simplex Table:

B S1 Sa Ratio
Ce

$1

51 5/4

L k s h l l 4 i

*(0)+ax la

S1= 6/7
sa-p

26
\latheacal ogamuy

K o n e
L rauk s h L E
a ld
a i
u w a s e e o t

27
 2 ) 20

Solutiom

A
3 1

The Dual Problem:

Mox &= |5yt a0ya

3. State the dual for the following LPP and hence solve LPP.

K o u e m

Minimize: C = 2lz1 +50r2

Subject to : 2r1 + 5? 2 12,
3r1 +7r2> 17,
T], I2 > 0

Solution:

A-[
The Dual function:

Max z lay,tya
dy,t 34as a
28
5y,+ 79a 50
where y,.Ya>0"
Matbematical Progtanwing TUTORIAL 2 SOVIVG LPP

Bv Ce 51 Ratio

al 3

Sa

-1a toS
-o /3
-3

Aj -f3
-

-7 3
3

4-3

*)

29
sloud the dot tomc h ocition ad o which outlts should hey sed them?

B
C2ml 31nl
D 20 ml 38 ml

Fomulate its dual aud solve tte LPP

Solution

w is dual variable of Room A Let

acA to C- 2t

KAD: AtoD = aO
9 RoomC
8c.B toc-31
2 Room D
XgpBtoo 38
of,
Mio z (5wt ox+ ly t l3
Min 2 aXAc + 20XAot 3) Xect 38 xBO
Consbaints
XAC t XBC 12
wty a

XAc tXAp> 15
Yect Xeo, 20
AC f XAtBctXeo >30
Xgo0
Dual

Let u, XAc + XBc

U,= hc t XAD
31
 |ORIAL! SOL\IVG LIP

Max z l3u, +13U, +ISV, 120V - 30W

aty 38

W a, , Vao
Grophical method s not opplicable
Simplex method is applicable
I3 |5 -30
B-V Sol Rotio
U Va W

S1

31

S3

38 32

13 30

Entering yoicbte W
Leovingaiable : S3

32
\Lhmalcal Pogruuw TUTOKAL! SOLVING L

2.3 POST-TUTORIAL

12

Solution

Z- 3x,+ 5x+ 05;tost os3

Sobject to :

K o uL
e m
a

33
 S1 Sa S3

S1 3 o

14

S3

-3

S1 -|

S3 6

34
Mathenatical Programmi1g TUTORIAL 2. SOLVING LPP

XA=6
S1= 6

K o n e
L r u
a k s u a
L i d
l c
t a t o

35
\Mathematical P'hogamg

Sube o 3

12

Solution

Primal Aoblem
Min C- l6x,+8x)+473
Subject to:

Dual froblern:

Max C= 6y,+ |
Subject to
1

36
thematical Progtatn TUTORIAL 2 SOLVING LPP

umplex telhod
4
3V Bv s1 53 Rotio
S1 I6 I6/3
4 3

S3

G 16
BV 8V Sa S3 Soln Ratio

3)s
1

16

4
Sa S3 SoI Ratio

4 O4 6"2

sa

16 o-4 O-5 Q.4

31-a

-I6 -S

37
Mathenatical l'omm TUTORIAL 2 SOLVIN, LPD

The valwes are

y:6.a

Xo4

4i:31-a

t o t s

F i t i t t o t L t

L a k s h u a t a d 1

K o n e r u

38
Alathematical Proganning TUTORIAL 2 SOLVING LI'"

3 A poducer of Healthv toodl kes two inpotant adscoet ingredients tHut go into tho
humanfood, nacd s alealthv ul tdCouuo) \Wa. Each kg of Healbhn \mol
300g of vitamins, 00g of potein.ad00 of cal Each kg of conmo nota 01
A of vitais, 3000 g of potem. and 200 of b Gidchues for ipm ioa Ha!
rquire auixture made hon these ingredent cota t east 900 g of viams 2100 !
protein, ad800 g of cubs. Helth an cUss $2 pe ky to produce ant Coon Mal l
$I 25 per kg to produce. Fudthe nunber of kgs of ch ingredient that shonldl e ponh
in order to mininize cost Obtain its Dual ad solve

Solution

Pimal:
Min c ax+ l-a5x
Subject to :
3oox,t lo0x >900
to0x, +3o0x> aaoo
(00x,+ aooxa> 8o0

Dual:
Max bC= 900y, taaooYatgoOY3
Subject to:

ooy,+ 3ooy,+a004a <I-as

shere y,, Ya o

39
 1LitheLtl'o

Simplex tethod:
300 300
o Soln Ratio
CBV BV S1

51 300 400
-
300 (-a5 I35/300

A400 300

60 a900 300
CBV Bv Sa Soln Xatio
S1 Soo00 Scol300
O"Oo4

-So0 -1300

The vaves of s1se4 6 Ya: O" 004 j:9-6

40
Mathemtical 'oglamm: TUTORAL 2 SOLVING LPP

L s h t
u :l
h :i

For Evaluator's Use only

Evaluators Comments Evaluator's Observation
Marks Secured out of 50

Full Name of the alator:

Signature of fke valuator:

Date of Evaluation:

42
Tutorial 3

Transportation problem
Date of the Session:

Learning outcomes:
Understanding the problem of transporting/shipping the comnodities from the
the destinations with the least possible industry to
cost while satisfving the supply and demand
imits.
3.1 PRE-TUTORIAL
1. List out different types of transportation nethods.
’Northwest Coner
’ least Cost
’Rauw Mioimum
’Counn Minimym

’ Vogel's Apprgfmation
I h o u e r i

43
Mathematical Programnming TUTORlAL 3. TRANSPORTATION PROBLEM

2. rule?
List out the steps iuvolved i solving the Tvuspurt ation problent tsing Nortlh-West cormer

’ Sehyp problem
’ Thitialize variables
’Repeat Alocaticn
-’Calcolote Total Cast
Optimalit

3. List out the steps involved in solving the Transpojation problem using Row Minimum
method.

’Roblen setup
’ Ioiialization e rLna k s h u a

’ Alocation
’ Iteraty
TotolCast

44
Mtheuuatil Poamu TUTORLAL3 HAVSTORI\UOV'OBLLA
3.2 IN-TUTORIAL
1 Lumos lus hae the .toues

hasp0tatiou costs (in Rs) Der wit ewceu tato j ad wchol|s> e IO heiow
Solve anspotat ion problem usg NIT coe e
Factory WuehouN"
WI W2 W3 W Supplv
1 30
F2 3 3 50
F3 4 2 20
Demand 20 40 30 10

Solution:

4
3O

to Lo
4
o
36 loo

304dot Sxlot 9x(o

ot6+ So +90

I K o u

45
 TRANSPORTAION PROBLEM
TUTORIAL 3
Mathenlaical Pogramnumg
state th po
depauueutal stoeLs thee plants octed thuoughout sht fom l
2 1e hodaya k1lo s of ee E h dayt ehop
Ton pactv 0, G0 and 70 rspectivel The Liliortliol1
50 md 60 gallons
ops RI. R2. R3. RI withat les 0 60 u Ros \ W I
uol
Soe DallNDotat)ou Dobleu
(ost (0l R ) le gNCH beon
Retibhop Supply
Stoe 23
7 80
3
G0
2 2
6 9 70
3 3
40 60 50 G0
Demand

Solution:

3
l20

3 6

3x40+ Sx 4o tSx ao t8xt4x(o+a x60

L a k

K o n e

46
\lathenatical Progamng TUTORIAL 3 TRANSORTATION PROBLEM

3xto + Sx 4o + ax6o+ 6x ao t+%So

= I0t200 tla0+lao+5o

I K o u L e r t

47
Mathenatical Iroamning TUTORIAL 3. TRANSPORTATION PROBLEM
3.3 POST-TUTORIAL

1. kL Uivesibanches located Vawda, lydeabad. md Cheuwa.

prOvide's couINe ateial in Diuted fouu at theSe Jocations wit}h capacities l5. 30 amd 20
units at Vijavawada, Hyderabad. aud Cheuai respcctively. The university distributes the
course material to studentslocatedat thre locatioIs Bangalore. Hvderabad and Coiubatorr
Tlhe dennand of tle students /s 5. 20 aud 40 uuits for Bangalore, Hyderabad and Coinbato
respectively Tihe cost of transportation per unit varies between different supply pomts and
destination points. Tlhe transportation costs are given in the table. The managennet o
KL University would like to deternmine minimum transportation cost.Solve
Transportat on
problem using ColunnMinimum method in Linear Programming using python.
U/S BGR HYD CON Supply
BZA 15 60 35 15
HYD 45 30 60 30
CHE 30 90 20 20
Demand 20 40

Solution:

35
d

60
IGOO
45

X 3o

65

xS +30x ao+aox ao+3SK\o+ 6oxlo

=75t600+ oo+ 25o+ 600

48
Mathemnatical Progrumnlg TTORAL 3 TRANSPORTATION PROBLEM

L i l t d t l o t

L a k s h t i a l :

K o n e r u

49
 50
Boot3ao+9564 =
x8+ox7+I0xatx|o
t60xa I9%5+8
34 a
Ao
60 3
to
Solution:
34 14 8
Demand
5
18 20 70 10 S3
9 60 10 30 70 S?
7 10 30 19 SI
Supplv DI D3 D2 DI F/D
Progalng Leu ehon \Muml
pobemlli;T Dausotao Solke Douldelahd the plouct
t he o
Lbl follow Tlhe DI pont)
D3 D2DI
PROBLEM
TRANSTO:TADOV TUTORIAL3
\litheuaiclP'ogg
Mathcmail Phomg TUTORLAL J TIRANSPORTATION PIOBLL1

c a t u l

L s u l : t h a d e

For Evaluator's Use only

Evaluators Comments Evaluator's Obser vation
Marks Secured
. out of 50

Full Name of the Evaluator

Signature ofthe valuator:

Date of Evaluation:

52
 Tutorial 4

Gomory's Cut-Plane Method

Date of the Session:

Learning outcomes:
" ithe optimal solution is integers, then problen is
solved, Otherwise, add Gomory's constraint
(cut) is added to optimal solution Now new problem is solved using dual simplex method The
method terminates as soon as optimal solution
becomeintegers.
4.1
PRE-TUTORIAL
1. Enumerate the steps involved in
Gomory's cutting plane method.
Step1: Build the 5implex Toble
stepa: check out the conditians build it
Stp3: Ihibally followthe simplex
Step4: Get the ortespodhig valoes
steps: If valgs are integer then Skop Det all steps
step6 :IErot by considerng themaxfracional vakje fromit
Step 7:Generate the seorce vOw'

Step 8: Updaty the toble

Shep 6olue it
Step lo: Wellget conesponding values

53
 Alitheuatical Pogramming |UTORIAL I GOMOHYS 1T HOD

4.2 IN-TUTORIAL
I Fnd solutio s g itepe sipex uthod (GooY CHtop: plne m1ho)

MaximizeZ
subjet t)
3r 2r) <i
I2 2
and rj. J) are 01-1Cgative mleYerS

Solution:

Mou(z) =X+t01+ 05a

’ 3x,+ax,t S1=5

Inibial Simplex Table

á k s : a l t h

Sol Ratio
Bv S1 Sa

S1

54
AMathematical l'ioyau TUTORIAL J GOMORYS ALTIOD

Ce
Sol Ratio
B-V S1 Sa

Sol Rotio
B-v S1

t l h o uLe r
a ?
k s l n u : d i

Toobtaion optimom inbeger we have bo add gooy cnstart

Haxs)

55
\athenhacal Pogamt TUTORIAL I GO\MOR) S MLTOD

Xtoa+s1+sa
Fractional cot constraint

Sol Ratio
BV S1 G1

G1
)

Sol
Sa Gi1
O l e r

S1

-|

36
 13 POST UOLAI

Solve the problen Gooy scing plane nthod

Z-14%tl6x,+0S1 +05a

6x,+ 8 ts2- la

I6
Sol Ratio
B-V 51 5a

S1 4 4

Sa 3 4 3

Sol Raig
S1 Sa
B-v
S1 3

3
16

I6 4

-4

57
Matheutlcl oapwy
Cp |4
Sol Ratio
B"v S1

6 a

14 I6 C 3

-a-3

Max()- Im considering X is the sOUYCe YO

fractional cut constraint

St

58
 \lathemical ogaunn. TUTORIAL I GOMORY'S AMETHOD
14 16
Sol Ratio
BV X, S1 G

-3)?
(6 -4

14 l6 3

- -3

CB 14 16
Sol
B-v G1

16
-

61

= 44
Ko

59
Matheula ical Poaming

L a s h u l a lt: t.hiht d

For Evaluator's Use only

EvaluatÍrs Comments Evaluator's Observation
Ko
Marks Secured
outaf 50
Full Namne of the Val4ator:

Signature of the Evaluator:

Date of Evaluation:

60
 Tutorial 5

Branch and Bound Method

Date of the Session:

Learning outcomes:

Understanding to do the process of solving branch and bound method.

Understanding to do the process of Gomory's cutting plane method.
5.1
PRE-TUTORIAL
1. What is branch and
bound Technique?
The branch and bond Techrigpe Systematcaly exploins soutbicn spaces Ry
bronching into sob Pryng poths that exceed kroLn bouds to
fnd optimal solotion.
k
I h o u e r U N a

2. Which strategy can be used to solve branch and

bend problem?

We can use Simplex method gophical metbod. Givaphical method is

Soitable foy ony buwovarioles- But where as Simplex-method for a s
more variables.

61
 Mathenaial 'eam
5.2 IN-TUTORIAL

3 3
Subjet to
3
212
I| -3r + 2r < 3
Where , I2, T3 >0 and iuteger. Get the
cutting plane method. optiual solution as an integer valne usiig Goioy
Solution:

3
CB
J
S1 Sa S3 Ratio
T5 3-35

3 4-5

3 3

3
B-V
K ß i e r t

a S1 Sa S3 Ratio
3 3-33

O33 O-66 D33

S-33

3 a 6 S

a 6 5

62
 \latheuatical Phoamng TUTORIAL ). JBRANCI AND BOUND AIETHOD

Xa
Ratio
3"33

O 0-33 O'66 o-33

3 X
3 3 6

BV
S1 S3 Ga

-75
3

O-75
-0-5

G-3 3

Rotio

B-y 3 S1 Sa S3 G1

-0°667

3 1-33
S1\
G1 1 O-66

03

Ratio
Sirce all -G=0 63
 TUTORIAL J BRANCII AND BOUND \ETHOD

)lBh d Bod tol to

Maximze Z = 31|
Subet to

2r <l0)
IWhere l e
I0l-negative iutegers
Solution:

Given,
+t74sas

Emax z- 3x, +5xa

ax,+4%4 a5

(o,4), 8,0)

Pointsare

64
 TUTORIAL ) BRANCH AND BOUND \MAITIOD

G lo la

By grophicol method
.:Intersecion point is (S4)

=35

Maxz-5
I K o n eLr a
u k s h u i ii e o d

65
 IUORAL S DRANCILAND BO0ND
MEiIOD

K o nLeaukshu.til

66
 Wathemaid P'roNlammly
TUTORIAL , LAVCAND 0UND ME.TIOD
5.3 POST-TUTORIAL
I Eplan

Snbject to:
r t ) <9

IW'here r|. I? 20 and are

integers.
Solution:

3,+ a+S1- 5, x+4t5a= q

6
B-v
Sol Raio
S1

S/, -5

Sa

G-j
6
Sol Ratio
S1 Sa

18 6 6

G-~j -I6

67
()9+()e
OE+8

89
Mathematal Programng

K o u e
L r
a u
k s h m a
E i adl h
u a h

69
Mathenlatica l'op: TWTORIAL J BRANCH AND BOUND METIOD

For Evaluator's Use only

Evaluators Comments Evaluator's Observation
Marks Secured . out of 50

Full Namne of the pvauator:

Signature of the Ea¥uator:

Date of Evaltation:

70
Tutorial6

Dynamic Programming
Date of the Session:

6.1 PRE-TUTORIAL
1. What is
Dynamic Programming?
Dynamio rogramming is a techniwe that besks the
7 Save the vesut foy fubuve problens into sJb-Po
POvpOsesSo that we do not need to conpute the
Yesult ogan
.the main se of dyngfie L a k s i û g

Limitations:The gethod applicable to only those

protblems which pos

2. State the
diferent types of Dynamic Programming?
the difo@rt types of dynanic pyframming are krapsack broelling
Salesman

71
 TUTORIAL 6 DYNAMC PROGHAU
b.2 IN-TUTORIAL
WNl/e thc Poht lor he 0/|kuapk hooleu
usuw dyuu DoLwy

Poht lleght

30
3

Given n=4; wo =I0

ei*s'u s,
s'- s°us,o

s°- {(o,))
s'- {(o,o), (19,5])

s -{Co,), ( a)

7-3
s- (o9,69, (a9), (69), 690), yro), (s9,3), (698), (9))
x=ste (a9) ss s (19)
25=0 sE (44) ss s°E( )
se (10+) ss s'(40,)
z'-o se (o,o) ss s'e(o)
40+So- 90

72
 TUTORIAL 6
POST-TUTORIAL DYNACROGRANINO
.OCCpt ol travelipy
6.3
sles Poblem
Solution
with cal-in CKHup
travelling Salesan problem (7ao) is
The a dassic
in comater science operations opioizoticn prcblern
vOwte thal allas a
Yesearhthe
oad is to fiod the shotest
A0ssible Salesman to visit a set of cities, exacty
to the standingáty

73
 /thellatical Prograuliug
TUTORIAL 6 DYNANJC PROGRAM\1|NG
ld tle istlce bol
Shortest possib: oute at 'INits (VUIV cityween Cvey pir of cit ies
xacly once d

20
10
15

25 30

35

Solution:
if i=)
Co (vE)
if (Gi)

iEV

will splitthe Gvoph into sub-problem

5ol) Fiyst of all we
node.
We oe choosing node-1initial
step |:

3
4

Step a!
=5.

74

- Min f1o +8f =18

1/atheIulical P'rogummg
TOTORIAL 6 DYNANIC P)GHA\G

=9+8 -17

=3tS-3

= 18

Sep 3
Gafs - mino tci43, J+cff93,
min 49+1s,iot33= at

min3H8, 9+17 - a6.

min 8+ I3

c{f9 min fdicfa, 633,,d0J+e[9is*3,9,

d+c[{9,33,)]
=min fot24, |5+26, aot21)
=min 43, , 41 75- 36
 /athematical Programming
TUTORIAL 6. DYNAMIC PROGRA.MUNG

path s | 2-
: The

o u d a t i

I h o u eLr ua k s h a t d

76
Ltheul.
itiCal Program1ning
TUTORIAL G DYNAMIC PROGRAIMING

I h O n eLr a k s h l l a l t h

77
1ZthMatiCal Proguming
T0TORIAL G DYNANCPROGHANINO

a k s h m a l a

For Evaluator's Use only

Evaluators Comments Evaluator's Observation
Marks Secured out of 50

Full Name of the Evalvator:

Signature of the aluator:

Date of Evaluation:

78