IFET COLLEGE OF ENGINEERING LESSON PLAN

Sub 4ode : #3!$0Sub Na%e : 3pp)ied Operations Research #ranch : M5#53 6nit: I Se%ester: II Tit)e: INTRO264TION TO LIN73R PRO"R3MMIN"

Format No.3b

LP 8er No: 01 2ate: Page: 01 of 0-

Objective: 1. To formulate a Linear programming problem LPP! from "et of "tatement". #. To "ol$e t%e LPP u"ing grap%i&al met%o' For # $ariable"! 3. To "ol$e t%e LPP u"ing primal "imple( met%o' For ) # $ariable" an' all *+ &on"traint"! ,. To "ol$e t%e LPP u"ing -ig./ an' T0o.P%a"e met%o'" For ) # $ariable" an' all mi(e' &on"traint"! 1. To "ol$e t%e LPP u"ing 'ual "imple( met%o' For ) # $ariable" an' t%e "olution i" infea"ible! 2. To un'er"tan' t%e effe&t of &%anging t%e $alue" of parameter" on t%e 'e&i"ion $ariable" Sen"iti$it3 Anal3"i"! Page Period Sessi Teachin No on Ref g Topics to be covered L T No Method 1 Introduction Operations Research- 4efinition" of OR5 S&ope of OR5 P%a"e" of OR5 /o'el" in OR5 Cla""ifi&ation of OR5 Appli&ation" of operation" re"ear&% in fun&tional area" of management. Linear Progra%%ing. Intro'u&tion5 General "tatement of LPP5 Formulation of LPP5 Step" in formulation in LPP5 Non.Negati$it3 Con'ition5 E(ample" of LPP. So)ution b* "raphica). Step" for Grap%i&al "olution of LPP5 E(ample" on /a(imi8ation an' /inimi8ation LPP5 e(ample" on mi(e' &on"traint" LPP5 /ultiple optimal "olution"5 No fea"ible "olution 5 9nboun'e' "olution. So)ution #* Si%p)e. Method. 4efinition5 Simple( Algorit%m5 Simple( Sla&: ;ariable"5 E(ample" on /a(imi8ation an' /inimi8ation LPP. So)ution #* #ig-M Method- 4efinition5 Simple( "urplu" an' Artifi&ial ;ariable5 -ig./ Algorit%m5 E(ample" on /a(imi8ation an' /inimi8ation LPP. T1o Phase- 4efinition5 T0o P%a"e Algorit%m5 Suitabilit3 /et%o'5 E(ample" on /a(imi8ation an' /inimi8ation LPP. Specia) cases- 9nboun'e' Solution5 'egenerate "olution5 Non.fea"ible "olution"5 /ultiple optimal "olution". 2ua) si%p)e. %ethod- Intro'u&tion5 Algorit%m5 E(ample". 2ua)it* in LPP- Intro'u&tion5 Prin&iple" of 4ualit35 Primal.4ual Relation"%ip. Sensitivit* 3na)*sis- C%anging t%e $alue" of parameter" on t%e 'e&i"ion $ariable"5 E(ample". 1 1 ! ! 1.1 6 1., 2.17 PPT "# PPT "# PPT "# PPT "# PPT "# PPT "# PPT "#

&'(

1+-&1

,'!'/'+ 10 11' 1$

$ $ 1 1 1 1

! ! ! !

&$-((!-,( ,,--0 -0--(

1&' 1(

-+-/+

PPT "#

IFET COLLEGE OF ENGINEERING LESSON PLAN

Format No.3b LP 8er No: 01 2ate: II Page: 0$ of 0-

Objective: 1. To arri$e at Initial -a"i& Fea"ible "olution" in Tran"portation /o'el" b3 u"ing Nort%.0e"t &orner met%o'5 /atri( /inima /et%o'5 ;ogel<" Appro(imation /et%o'. #. To &%e&: for optimalit3 an' to arri$e at optimalit3 in Tran"portation /o'el" -3 u"ing /O4I an' Stepping Stone met%o'. 3. To "ol$er an' learn t%e 'ifferent a""ignment mo'el" an' tra$elling "ale"man problem. Sessio Page Period Re Teaching n No Topics to be covered f Method L T No Transportation Mode)s. Intro'u&tion to TP5 /at%emati&al Formulation5 S&ope of TP5 -alan&e' 1=#. PPT 1, 1 ! an' unbalan&e' Ca"e" for TP5 Appli&ation of 1=, "# Tran"portation /o'el" 4hec9ing for Opti%a)it*- North-:est 4orner 1=,. PPT 1-'1! Ru)e. N>CR Algorit%m5 E(ample" on 1 1 ! 1=2 "# /a(imi8ation an' /inimi8ation on TP. Least 4ost Or Matri. Mini%a Method- Lea"t 10-PPT 1/'1+ Co"t Algorit%m5 E(ample" on /a(imi8ation an' 1 1 ! "# /inimi8ation on TP. 8oge);s 3ppro.i%ation Method<83M=- Step" for fin'ing t%e initial ba"i& fea"ible "olution5 10+PPT $0'$1 $ ! E(ample" on /a(imi8ation an' /inimi8ation on "# TP. 4hec9 for opti%a)it*- C%oo"ing for optimalit35 11$Fin'ing optimalit3 "olution b3 u"ing /O4I /et%o'5 Fin'ing optimalit3 "olution b3 u"ing PPT $$'$& 1 1 ! Stepping Stone /et%o'. "# 117. 2egenerac*. Step" to "ol$e t%e 'egenera&3 1,= problem"5 e(ample" for 'egenera&3 in TP. Tranship%ent Mode)sIntro'u&tion to tran"%ipment5 4ifferen&e bet0een TP an' 1(1PPT $( 1 ! Tran"%ipment problem5 /anagerial appli&ation" of "# Tran"%ipment an' Tran"portation problem". 3ssign%ent Prob)e%- Intro'u&tion5 mat%emati&al formulation5 -alan&e' an' unbalan&e' &a"e" in 1((a""ignment problem. PPT $, 1 ! >ungarian procedure- Algorit%m for ?ungarian 1,2. "# met%o'5 e(ample" on minimi8ation5 ma(imi8ation 11@ a""ignment problem" an' unbalan&e' problem". Trave))ing Sa)es%an Prob)e%- Intro'u&tion5 'ifferen&e bet0een a""ignment an' Tra$elling "ale"man problem5 E(ample" for Tra$elling 1,+PPT $-'$! "ale"man problem5 unbalan&e' &a"e" in 1 1 ! "# a""ignment an' tra$elling "ale"man problem. Cre0 a""ignment. 4efinition5 E(ample" for &re0 a""ignment Problem".

IFET COLLEGE OF ENGINEERING LESSON PLAN

Format No.3b

Sub 4ode : #3!$0LP 8er No: 01 Sub Na%e : 3pp)ied Operations Research 2ate: #ranch : M5#53 6nit: II Page: 0& of 0Se%ester: III Tit)e: INT7"7R PRO"R3MMIN" 3N2 "3M7 T>7OR@ Objective: 1. To arri$e at optimal integer $alue" u"ing -ran&% 6 -oun' Algorit%m #. To arri$e at optimal integer $alue" u"ing Gomor3<" &utting plane Algorit%m 3. To &ompute t%e "trategie" on t%e 'ifferent game t%eor3 mo'el" u"ing a $ariet3 of algorit%m". Page Period Sessio No Teaching n Topics to be covered Ref Method L T No $/ $+'&0' &1 &$ && &( &,'&-' &! &/'&+ (0 Integer Progra%%ing Prob)e%s- Intro'u&tion5 Importan&e of IPP5 Appli&ation" of IPP5 Nature of IPP5 t3pe" of IPP". 4utting P)ane Method- 4efinition"5 Pro&e'ure for "ol$ing IPP5 E(ample" for pure IIP met%o'" an' E(ample" for mi(e' IIP met%o'". #ranch #ound 3)gorith% Method- 4efinition"5 Pro&e'ure for "ol$ing IPP5 E(ample" for pure IIP met%o'" an' E(ample" for mi(e' IIP met%o'". "a%e theor*. 4efinition5 Pa3.off5 T3pe" of Game"5 t%e /a(imin./inima( Prin&iple5 Propertie" of game"5 a""umption of game5 terminolog3 in game t%eor3. Sadd)e Point- E(ample" for T0o per"on Aero "um game"5 E(ample" for Sa''le point5 E(ample" for game 0it%out "a''le point. "raphica) Method- 4efinition" for Grap%i&al met%o' for # ( n or m(# game"5 E(ample" Grap%i&al met%o' for # ( n or m(# game". 2o%inance Ru)e- 4ominan&e Algorit%m5 "olution for m ( n game u"ing 'ominan&e rule. 4onve. Linear 4o%bination <3verages=- Algorit%m for Con$e( Linear Combination5 Solution for m B n u"ing &on$e( linear 1!/1 1 $ 1 1 1 1 $ 1 1 1 ! ! ! (&!(&+"# ! 1+$! ($(! ($+! (&1"# "# "# "# PPT ! 1!+"# PPT

IFET COLLEGE OF ENGINEERING LESSON PLAN

Format No.3b

Sub 4ode : #3!$0LP 8er No: 01 Sub Na%e : 3pp)ied Operations Research 2ate: #ranch : M5#53 6nit: II Page: 0( of 0Se%ester: III Tit)e: IN87NTOR@ MO27LS' SIM6L3TION 3N2 274ISION T>7OR@ Objective: 1. To "ol$e 'etermini"ti& In$entor3 mo'el problem" u"ing EOC an' E-C mo'el". #. To "imulate u"ing monte.&arlo "imulation met%o' u"ing ran'om number" 3. To "ol$e 'e&i"ion ma:ing problem" un'er "ituation" of ri": an' un&ertaint3. Session No Period Topics to be covered Inventor* Mode)s- /eaning of in$entor35 rea"on" for maintaining in$entorie"5 t3pe" of in$entor35 in$entor3 &o"t"5 $ariable" in t%e in$entor3 problem5 fa&tor in$ol$e' in in$entor3 anal3"i" 2eter%inistic Inventor* Mode)- EOC /o'el 0it% an' 0it%out "%ortage"5 C%ara&teri"ti& of EOC /o'el 0it% an' 0it%out "%ortage"5 formula for EOC /o'el5 Solution for EOC /o'el 0it%out "%ortage". 2eter%inistic Inventor* Mode)- E-C /o'el 0it% an' 0it%out "%ortage"5 C%ara&teri"ti& of E-C /o'el 0it% an' 0it%out "%ortage"5 Formula for E-C /o'el5 Solution for E-C /o'el 0it% "%ortage". Auantit* 2iscount Mode)s- /eaning5 Single Duantit3 'i"&ount5 multiple Duantit3 'i"&ount". 2ecision Theor*. Intro'u&tion5 &la""ifi&ation5 Element5 Step" in$ol$e' in 'e&i"ion t%eor35 'e&i"ion ma:ing en$ironment. 2ecision %a9ing under 6ncertaint*. Criteria for 'e&i"ion ma:ing un'er 9n&ertaint35 e(ample" for 'e&i"ion ma:ing un'er 9n&ertaint3. 2ecision %a9ing under ris9- Criteria for 'e&i"ion ma:ing un'er Ri":5 e(ample" for 'e&i"ion ma:ing un'er ri":. 2ecision tree- Step" in 'e&i"ion tree anal3"i"5 a'$antage" an' 'i"a'$antage" of 'e&i"ion tree approa&%. Si%u)ation- Intro'u&tion to "imulation5 Pro&e"" of "imulation5 a'$antage" an' 'i"a'$antage" in "imulation. Monte- 4ar)o Si%u)ation- Pro&e'ure for /onte. Carlo "imulation5 Appli&ation" of Simulation te&%niDue5 Appli&ation of "imulation for 'e&i"ion ma:ing. L 1 T Ref Page No

Teaching Method PPT

(1

($

PPT

(&'(('(, ((! (/

$ 1 1 1

! ! ! !

PPT PPT PPT PPT "#

(+',0',1

PPT "#

,$',&

PPT "#

IFET COLLEGE OF ENGINEERING LESSON PLAN

Format No.3b

Sub 4ode : #3!$0LP 8er No: 01 Sub Na%e : 3pp)ied Operations Research 2ate: 0&-0+-1$ #ranch : M5#53 6nit: 8 Page: 0, of 0Se%ester: III Tit)e: A676IN" T>7OR@ 3N2 R7PL347M7NT MO27LS Objective: 1. To "ol$e problem" in$ol$ing "ingle &%annel mo'el" #. To "ol$e problem" in$ol$ing multi.&%annel mo'el" 3. To &ompute repla&ement of item" t%at 'eteriorate" 0it% time Capital item"! bot% 0it% an' 0it%out time $alue of mone3. ,. To &ompute repla&ement of item" t%at fail "u''enl3 Group repla&ement!. Session No Period Topics to be covered Aueuing Theor*- Intro'u&tion5 &on&ept of Dueue5 &o"t anal3"i"5 &%ara&teri"ti&" of Cueuing t%eor35 Appli&ation of Cueuing t%eor35 A'$antage" of Dueuing t%eor35 'i"a'$antage" of Dueuing t%eor35 -a"i& Element" of Dueuing t%eor35 Dueue 'i"&ipline. Aueuing Theor* Sing)e.Probabili"ti& Dueuing mo'el5 Single &%annel Dueuing mo'el"5 Single "er$er an' infinite population5 E(er&i"e" for Single "er$er an' infinite population. Aueuing Theor* Sing)e.Probabili"ti& Dueuing mo'el5 Single &%annel Dueuing mo'el"5 Single "er$er an' finite population5 E(er&i"e" for Single "er$er an' finite population. Mu)ti-channe) %ode)s. Intro'u&tion5 /ultiple "er$er an' infinite population5 E(er&i"e" for /ultiple "er$er an' infinite population. Mu)ti-channe) %ode)s. Intro'u&tion5 /ultiple "er$er an' finite population5 E(er&i"e" for /ultiple "er$er an' finite population. Rep)ace%ent Mode)s- T3pe" of repla&ement mo'el"5 repla&ement poli&3 for item" 0%i&% 'eteriorate" gra'uall35 repla&ement 0it% an' 0it%out mone3 $ale" &%ange"5 e(er&i"e for repla&ement. Individua) rep)ace%ent. Intro'u&tion5 to fin' t%e optimal repla&ement poli&35 e(er&i"e. "roup Rep)ace%ent- Intro'u&tion5 Pro&e'ure for group repla&ement5 e(er&i"e. L T Ref Page No Teaching Method PPT 1 ! 3@7. 3@@ "#

,(

,,',-

,==. ,1= (10-

PPT "#' 8ideos PPT "# 8ideos PPT "#' 8ideos PPT "# 8ideos PPT PPT PPT "# "# "#

,!',/', + -0 -1'-$

1 1 1

! !

(1&(1+-

-& -('-, --

1 1 1 1

! ! !

&/0&/-&+0-

"# B ")ass #oard

PPT B Po1er Point Presentation

IFET COLLEGE OF ENGINEERING LESSON PLAN

Format No.3b

1,

1. Paneer"el$am R.5 Operation" Re"ear&%5 Prenti&e ?all of In'ia5 Fourt% Print5 #==7. #. N. 4 ;o%ra5 Cuantitati$e Te&%niDue" in /anagement5Tata /&gra0 ?ill5 #=1=. 3. Pra'eep Praba:ar Pai5 Operation" Re"ear&% . Prin&iple" an' Pra&ti&e5 O(for' ?ig%er E'u&ation5 R7D7R7N47S ,. ?am'3 A Ta%a5 Intro'u&tion to Operation" Re"ear&%5 Prenti&e ?all In'ia5 Se$ent% E'ition5 T%ir' In'ian Reprint #==, 1. G. Srini$a"an5 Operation" Re"ear&% E Prin&iple" an' Appli&ation"5 P?I5 #==F. 2. Gupta P.G5 ?ira 4.S5 Problem in Operation" Re"ear&%5 S.C%an' an' Co5 #==F. F. Gala$at%3 S5 Operation" Re"ear&%5 Se&on' E'ition5 ;i:a" Publi"%ing ?ou"e5 #==,. 7. Fre'eri&: 6 /ar: ?illier5 Intro'u&tion to /anagement S&ien&e E A /o'eling an' &a"e "tu'ie" approa&% 0it% "prea'"%eet"5 Tata /&gra0 ?ill5 #==1. Prepared b* Signature Na%e 2esignation 3pproved b*