BA7206- Lesson Plan

8/13/2019 BA7206- Lesson Plan

1/6

IFET COLLEGE OF ENGINEERINGLESSON PLAN Format No.3b

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"!

. 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$itAnal "i"!

SessionNo Topics to be covered

PeriodRef

PageNo

TeachingMethodL T

1

Introduction Operations Research- 4efinition" of OR5S&ope of OR5 P%a"e" of OR5 /o'el" in OR5 Cla""ifi&ationof OR5 Appli&ation" of operation" re"ear&% in fun&tionalarea" of management.

11!

16

1 ,

PPT "#

$Linear Progra%%ing Intro'u&tion5 General "tatementof LPP5 Formulation of LPP5 Step" in formulation in LPP5

Non Negati$it Con'ition5 E(ample" of LPP.1 ! 2 17 PPT "#

&'(

So)ution b* "raphica) Step" for Grap%i&al "olution ofLPP5 E(ample" on /a(imi8ation an' /inimi8ation LPP5e(ample" on mi(e' &on"traint" LPP5 /ultiple optimal"olution"5 No fea"ible "olution 5 9nboun'e' "olution.

1 1 ! 1+-&1PPT

"#

,'So)ution #* Si%p)e. Method 4efinition5 Simple(Algorit%m5 Simple( Sla&: ;ariable"5 E(ample" on/a(imi8ation an' /inimi8ation LPP.

$ ! &$-( PPT "#

!'/'+So)ution #* #ig-M Method- 4efinition5 Simple( "urplu"an' Artifi&ial ;ariable5 -ig / Algorit%m5 E(ample" on/a(imi8ation an' /inimi8ation LPP.

$ 1 ! (!-,( PPT "#

10T o Phase- 4efinition5 T0o P%a"e Algorit%m5 Suitabilit/et%o'5 E(ample" on /a(imi8ation an' /inimi8ationLPP.

1 ! ,,- 0 PPT "#

11'1$

Specia) cases- 9nboun'e' Solution5 'egenerate "olution5 Non fea"ible "olution"5 /ultiple optimal "olution". 1 1 ! 0- (

PPT "#

1&'1(

2ua) si%p)e. %ethod- Intro'u&tion5 Algorit%m5E(ample".2ua)it* in LPP- Intro'u&tion5 Prin&iple" of 4ualit 5Primal 4ual Relation"%ip.Sensitivit* 3na)*sis- C%anging t%e $alue" of parameter"on t%e 'e&i"ion $ariable"5 E(ample".

$ ! +-/+ PPT "#

Sub 4ode : #3!$0

Sub Na%e : 3pp)ied Operations Research

#ranch : M5#53

6nit: I Se%ester: IITit)e: INTRO264TION TO LIN73R PRO"R3MMIN"

LP 8er No: 01

2ate:

Page: 01 of 0


2/6


3/6


4/6


Objective:1. To "ol$e 'etermini"ti& In$entor mo'el problem" u"ing EO an' E- 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&ertaint .


PeriodRef

PageNo

L TTeachingMethod

(1

Inventor* Mode)s- /eaning of in$entor 5 rea"on"for maintaining in$entorie"5 t pe" of in$entor 5in$entor &o"t"5 $ariable" in t%e in$entor problem5fa&tor in$ol$e' in in$entor anal "i"

1 ! PPT

($

2eter%inistic Inventor* Mode)- EO /o'el 0it%an' 0it%out "%ortage"5 C%ara&teri"ti& of EO /o'el0it% an' 0it%out "%ortage"5 formula for EO /o'el5Solution for EO /o'el 0it%out "%ortage".

1 ! PPT

(&'(('(,

2eter%inistic Inventor* Mode)- E- /o'el 0it%an' 0it%out "%ortage"5 C%ara&teri"ti& of E- /o'el0it% an' 0it%out "%ortage"5 Formula for E- /o'el5Solution for E- /o'el 0it% "%ortage".

$ 1 !PPT

( Auantit* 2iscount Mode)s- /eaning5 Single

Duantit 'i"&ount5 multiple Duantit 'i"&ount". 1 !PPT

(!2ecision Theor* Intro'u&tion5 &la""ifi&ation5Element5 Step" in$ol$e' in 'e&i"ion t%eor 5 'e&i"ionma:ing en$ironment.

1 ! PPT

(/2ecision %a9ing under 6ncertaint* Criteria for'e&i"ion ma:ing un'er 9n&ertaint 5 e(ample" for'e&i"ion ma:ing un'er 9n&ertaint .

1 ! PPT "#

(+',0',1

2ecision %a9ing under ris9- Criteria for 'e&i"ionma:ing un'er Ri":5 e(ample" for 'e&i"ion ma:ingun'er ri":.2ecision tree- Step" in 'e&i"ion tree anal "i"5a'$antage" an' 'i"a'$antage" of 'e&i"ion treeapproa&%.

$ 1 ! PPT "#

,$',&

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 /onteCarlo "imulation5 Appli&ation" of Simulationte&%niDue5 Appli&ation of "imulation for 'e&i"ionma:ing.

1 1 ! PPT "#

Sub 4ode : #3!$0Sub Na%e : 3pp)ied Operations Research#ranch : M5#536nit: IISe%ester: IIITit)e: IN87NTOR@ MO27LS' SIM6L3TION 3N2274ISION T>7OR@

LP 8er No: 01

2ate:

Page: 0( of 0


5/6


Sub 4ode : #3!$0Sub Na%e : 3pp)ied Operations Research#ranch : M5#536nit: 8Se%ester: IIITit)e: A676IN" T>7OR@ 3N2 R7PL347M7NTMO27LS

LP 8er No: 01

2ate: 0&-0+-1$

Page: 0, of 0

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 mone .,. To &ompute repla&ement of item" t%at fail "u''enl Group repla&ement!.


PeriodRef

PageNo TeachingMethodL T

,(

Aueuing Theor*- Intro'u&tion5 &on&ept of Dueue5 &o"tanal "i"5 &%ara&teri"ti&" of ueuing t%eor 5 Appli&ationof ueuing t%eor 5 A'$antage" of Dueuing t%eor 5'i"a'$antage" of Dueuing t%eor 5 -a"i& Element" ofDueuing t%eor 5 Dueue 'i"&ipline.

1 !3@73@@

PPT "#

,,',

Aueuing Theor* Sing)e Probabili"ti& Dueuing mo'el5Single &%annel Dueuing mo'el"5 Single "er$er an'infinite population5 E(er&i"e" for Single "er$er an'infinite population.

1 1 !,==,1=

PPT "#'8ideos

,!',/',+

Aueuing Theor* Sing)e Probabili"ti& Dueuing mo'el5Single &%annel Dueuing mo'el"5 Single "er$er an' finite

population5 E(er&i"e" for Single "er$er an' finite population.

$ 1 !(10- PPT "#

8ideos

0Mu)ti-channe) %ode)s Intro'u&tion5 /ultiple "er$eran' infinite population5 E(er&i"e" for /ultiple "er$eran' infinite population.

1 ! (1&- PPT "#'8ideos

1' $Mu)ti-channe) %ode)s Intro'u&tion5 /ultiple "er$eran' finite population5 E(er&i"e" for /ultiple "er$er an'

finite population.

1 1 ! (1+- PPT "#8ideos

&

Rep)ace%ent Mode)s- T pe" of repla&ement mo'el"5repla&ement poli& for item" 0%i&% 'eteriorate"gra'uall 5 repla&ement 0it% an' 0it%out mone $ale"&%ange"5 e(er&i"e for repla&ement.

1 ! &/0- PPT "#

(' , Individua) rep)ace%ent Intro'u&tion5 to fin' t%eoptimal repla&ement poli& 5 e(er&i"e. 1 1 !&/ - PPT "#

"roup Rep)ace%ent- Intro'u&tion5 Pro&e'ure forgroup repla&ement5 e(er&i"e. 1 !

&+0- PPT "#

"# B ")ass #oard PPT B Po er Point Presentation


6/6


4ourse 2e)iver* P)an:

ee9s 1 $ & ( , ! / + 10

11 1$ 1& 1( 1,

6nits

T7?T #OOCS

1. Paneer"el$am R.5 Operation" Re"ear&%5 Prenti&e ?all of In'ia5 Fourt% Print5 #==7.#. N. 4 ;o%ra5 uantitati$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&ation5R7D7R7N47S

,. ?am' A Ta%a5 Intro'u&tion to Operation" Re"ear&%5 Prenti&e ?all In'ia5 Se$ent% E'ition5 T%ir' In'ianReprint #==,

. G. Srini$a"an5 Operation" Re"ear&% Prin&iple" an' Appli&ation"5 P?I5 #== .2. Gupta P. 5 ?ira 4.S5 Problem in Operation" Re"ear&%5 S.C%an' an' Co5 #== .

. ala$at% 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 A /o'eling an' &a"e "tu'ie"approa&% 0it% "prea'"%eet"5 Tata /&gra0 ?ill5 #== .

Prepared b* 3pproved b*

Signature

Na%e

2esignation

BA7206- Lesson Plan

Documents

Transcript of BA7206- Lesson Plan