Lesson Plan : Operations Research 2020-21

 

1	Introducing Operations Research and its application in business areas. And to build capabilities in the students for analyzing and developing mathematical formulation to solve real life business problems and to yield maximum profit by limited resources by using different methods of Linear Programming Problems
2	Aims to provide knowledge on transporting various quantities to various destinations with minimum cost and to assign number of resources to equal number of activities with minimum cost
3	The course is aims to provide deep understanding of the dynamic theory and concepts of decision making process in multi stage process dependent on strategy chosen and in  business, industry decision variables are constrained to non- negative integer values by Integer Programming
4	Aims to make the students to take effective decisions in a competitive situation by using game theory methods and to examine the process of simulation and necessary tools to analyse stochastic problems
5	Introducing network scheduling for planning large projects and by using controlling techniques like CPM, PERT to check the actual progress against the scheduled duration. Imparts knowledge regarding calculating the need for replacement of resources in business

 

Course Outcomes:

	DESCRIPTION	Bloom’s Level
	At the end of this course the student will able to:
CO1	Students will identify and develop operational research models from the verbal description of the real system by studying LPP and understand the various Mathematical techniques that are needed to solve linear programming problems such as Simplex Method, Big-M and Two-Phase method	Factual Apply
CO2	Students will learn to solve Transportation and Assignment problems by solving them using various methods.	Factual Apply
CO3	The concept of Dynamic Programming and Integer Programming will enhance their knowledge and mathematical logics.	Factual Apply
CO4	Enables to take best course of action out of several alternative courses for the purpose of achieving objectives by applying game theory	Faculty Apply
CO5	Construct  and control large projects by using CPM & PERT models to improve decision making and recommends most suitable replacement policy for replacing faulty units in business	Factual Apply

 

Contents/Activities:

1	Factual	·         Importance, History of OR, Definition, Features, Scope of Operations Research, Linear Programming: Introduction, advantages of using LP (Unit-1) ·         Definition of Transportation model, Variations in Transportation Problem, The Assignment Model(Unit-2) ·         Dynamic Programming, Integer Programming (Unit-3) ·         Game Theory: Introduction, Two Person Zero –Sum games, Pure Strategies, Simulation Inventory and Waiting Lines(Unit – 4) ·         Replacement models(Unit-5)
2	Conceptual	·         formation of mathematical Modelling (Unit-1) ·         Tests for Optimality (Unit-2) ·         Mixed strategies(Unit – 4)
3	Procedural	·         Graphical Method, the simplex method, Artificial variable techniques: big M method (Unit-1) ·         Methods for finding Initial solution, The Assignment Model, Travelling Salesman Problem (Unit-2) ·         Branch And Bound Method (Unit-3) ·         Games with Saddle Point(Unit – 4) ·         Drawing Networks (Unit-5)
4	Applied	·         Application areas of LP, Justification, interpretation of significance of all elements in simplex tableau (Unit-1) ·         Application of Transportation model (Unit-2) ·         Applications of DP - Capital Budgeting, Production Planning, Solving Linear Programming Problem(Unit-3) ·         Rules of Dominance, Solution methods of Games without saddle point – Algebraic, Matrix and Arithmetic methods, Inventory and Waiting Lines (Unit – 4)_ ·         identifying critical path, probability of completing the project within given time, project crashing, optimum cost and optimum duration, Replacement models comprising single replacement and group replacement (Unit-5)

 

 

Andhra Loyola Institute of Engineering and Technology

Department of Master of Business Administration

Course Name: Operations Research     Program: MBA     Year-Semester: II-III     Academic Year: 2020-21    Faculty Name: V.Naga Lakshmi

Lesson Plan

Lecture No.			Topic	Objectives	Ref./Text Book Page No.'s	Teaching Aid	Before Class - Videos, e-Books, Case studies	Post Class - Assignment, Discussion Forum
UNIT- I [ INTRODUCTION ] Importance, History of OR, Definition, Features, Scope of Operations Research – Linear Programming: Introduction, advantages of using LP – Application areas of LP – formation of mathematical Modelling, Graphical Method, the simplex method; Justification, interpretation of significance of all elements in simplex tableau, Artificial variable techniques: big M method.
L1	Importance, History of OR			Introducing Operations Research and its application in business areas. And to build capabilities in the students for analyzing and developing mathematical formulation to solve real life business problems and to yield maximum profit by limited resources by using different methods of Linear Programming Problems	T1:25-26	PPT & Youtube Video	https://www.youtube.com/watch?v=ILWbaWrjgU4	Assignment-1, Quiz-1, Discussion Forum-1
L2	Definition, Features, Scope of Operations Research				T1:26-27	PPT	https://www.youtube.com/watch?v=H830AC07MY8
L3	Linear Programming: Introduction, advantages of using LP, Application areas of LP				T1:39-40	PPT	https://www.youtube.com/watch?v=Uo6aRV-mbeg
L4	Formation of mathematical Modelling				T1: 40	PPT
L5	Problems For Practice				T1:40-42	PPT, Chalk & Talk	https://www.youtube.com/watch?v=oaEmCiKMmdI
L6	Graphical Method
L7	Problems For Practice				T1: 65-73	PPT, Chalk & Talk	https://www.youtube.com/watch?v=8IRrgDoV8Eo
L8	The Simplex Method
L9	Justification, interpretation of significance of all elements in simplex tableau				T1: 87,99-104 T1:108-111	PPT, Chalk & Talk	https://www.youtube.com/watch?v=zDch07vVBxI
L10	Problems For Practice
L11	Problems For Practice
L12	Artificial variable techniques: big M method.
L13	Problems  For Practice
L14	Problems For Practice
UNIT –II [Transportation, Assignment Models] Transportation, Assignment Models: Definition and Application of Transportation model, Methods for finding Initial solution – Tests for Optimality – Variations in Transportation Problem, The Assignment Model, Travelling Salesman Problem
L15		Definition and Application of Transportation model		Aims to provide knowledge on transporting various quantities to various destinations with minimum cost and to assign number of resources to equal number of activities with minimum cost	T1:247-248	PPT, Chalk & Talk		Assignment-2 Quiz-2 Discussion Forum-2
L16		Methods for finding Initial solution (NW Rule)			T1:253,254 T2:203,204 T1:255 T1:259-262	PPT, Chalk & Talk	https://www.youtube.com/watch?v=3M_r6FgM1iU
L17		Problems For Practice
L18		Methods for finding Initial solution (Least cost Method)
L19		Problems For Practice
L20		Methods for finding Initial solution (Row Minima Method)				PPT, Chalk & Talk	https://www.youtube.com/watch?v=wuYVUZWJre8
L21		Problems For Practice
L22		Methods for finding Initial solution (Column minima Method)
L23		Problems For Practice
L24		Methods for finding Initial solution(Vogel’s Approximation Method)				PPT, Chalk & Talk	https://www.youtube.com/watch?v=KVGEXbmvsfk
L25		Problems For Practice
L26		Tests for Optimality (MODI method)
L27		Problems For Practice				PPT, Chalk & Talk
L28		Problems For Practice
L29		Variations in Transportation Problem				PPT	https://www.yourarticlelibrary.com/ergonomics/operation-research/assignment-problem-in-linear-programming-introductionand-assignment-model/34712
L30		The Assignment Model,
L31		Problems For Practice			T2: 276-284 T1:320-322	PPT, Chalk & Talk
L32		Problems For Practice					https://www.youtube.com/watch?v=7rlJgeFaNLQ
L33		Travelling Salesman Problem
L34		Problems For Practice
UNIT-III [Dynamic Progamming] Dynamic Programming, Applications of DP ( Capital Budgeting, Production Planning, Solving Linear Programming Problem), Integer Programming – Branch And Bound Method.
L35			Dynamic Programming	The course is aims to provide deep understanding of the dynamic theory and concepts of decision making process in multi stage process dependent on strategy chosen and in  business, industry decision variables are constrained to non- negative integer values by Integer Programming	T2:569-571	PPT, Chalk & Talk	https://www.youtube.com/watch?v=ewXklhesC-w                         https://www.youtube.com/watch?v=upcsrgqdeNQ	Assignment-3 Quiz-3 Discussion Forum-3
L36			Applications of DP (Capital Budgeting)		T1: 36-367	PPT, Chalk & Talk
L37			Problems For Practice			Chalk & Talk
L38			Applications of DP (Production Planning)		T2: 588-590	PPT, Chalk & Talk
L39			Problems For Practice			Chalk & Talk
L40			Presentations			Chalk & Talk
L41			Presentations
L42			Presentations
L43			Presentations
L44			Applications of DP (Solving LinearProgramming Problem)		T2:602-605 T1:369-371	PPT, Chalk & Talk
L45			Problems For Practice			Chalk & Talk
L46			Integer Programming		T1:177-184	PPT, Chalk & Talk
L47			Problems For Practice			Chalk & Talk
L48			Branch And Bound Method		T1:188-191	PPT, Chalk & Talk
L49			Problems For Practice			Chalk & Talk
UNIT –IV [Game Theory] Game Theory: Introduction, Two Person Zero –Sum games, Pure Strategies, Games with Saddle Point, Mixed strategies, Rules of Dominance, Solution methods of Games without saddle point – Algebraic, Matrix and Arithmetic methods, Simulation _ Simulation Inventory and Waiting Lines
L50	Game Theory: Introduction			Aims to make the students to take effective decisions in a competitive situation by using game theory methods and to examine the process of simulation and necessary tools to analyse stochastic problems	T1:443	PPT, Chalk & Talk	https://www.youtube.com/watch?v=4btaR_hIJm0   https://www.youtube.com/watch?v=N71pP5XHez4                                     https://www.youtube.com/watch?v=ogv3z-fs1cM	Assignment-4 Quiz-4 Discussion Forum-4
L51	Two Person Zero –Sum games				T1:443	PPT, Chalk & Talk
L52	Problems For Practice				T1:443-444	PPT, Chalk & Talk
L53	Sum games, Pure Strategies				T1:444	PPT, Chalk & Talk
L54	Games with Saddle Point				T1:445-448	PPT, Chalk & Talk
L55	Problems For Practice					PPT, Chalk & Talk
L56	Mixed strategies, Rules of Dominance				T1: 450-458	PPT, Chalk & Talk
L57	Problems For Practice					PPT, Chalk & Talk
L58	Solution methods of Games without saddle point					PPT, Chalk & Talk
L59	Algebraic, Matrix and Arithmetic methods				T1:465-470	Chalk & Talk
L60	Problems For Practice					Chalk & Talk
L61	Problems For Practice					Chalk & Talk
L62	Problems For Practice					Chalk & Talk
L63	Simulation Inventory and Waiting Lines				T1:639,646-653	PPT, Chalk & Talk
L64	Problems For Practice					Chalk & Talk
UNIT –V [PERT & CPM, and replacement Model] PERT & CPM, and replacement Model: Drawing Networks, identifying critical path, probability of completing the project within given time – project crashing, optimum cost and optimum duration. Replacement models comprising single replacement and group replacement
L65			PERT & CPM, and replacement Model: Drawing Networks	Introducing network scheduling for planning large projects and by using controlling techniques like CPM, PERT to check the actual progress against the scheduled duration. Imparts knowledge regarding calculating the need for replacement of resources in business	T1:763-770	PPT, Chalk & Talk	https://www.youtube.com/watch?v=L1qraeW5RQk     https://www.youtube.com/watch?v=fsScGps32Q0   https://www.youtube.com/watch?v=WQwKuAQDU3I   https://www.youtube.com/watch?v=TQnaMAYm9AU	Assignment-5 Quiz-5 Discussion Forum-5
L66			Problems For Practice			Chalk & Talk
L67			Identifying critical path		T1:771-778	Chalk & Talk
L68			Problems For Practice			Chalk & Talk
L69			Probability of completing the project within given time		T1:781-788	PPT, Chalk & Talk
L70			Problems For Practice			Chalk & Talk
L71			Project crashing, optimum cost and optimum duration			PPT, Chalk & Talk
L72			Problems For Practice			Chalk & Talk
L73			Replacement models comprising single replacement		T2:342-344 T2:358-360	PPT, Chalk & Talk
L74			Problems For Practice			Chalk & Talk
L75			Group replacement		T2:360-365	Chalk & Talk
L76			Presentations			Chalk & Talk
L77			Presentations
L78			Presentations
L79			Presentations

 

TEXT BOOKS:

T1) Operations Research, Kanti Swarup, PK.Gupta, Man Mohan, S.Chand

T2) Operations Research, SD Sharma, JNTU AP

 

 

REFERENCE BOOKS:

 

R1)    Operations Research Techniques for Mangement ,VK Kapoor, Sultan Chand

R2) Operation Research – Theory and Applications, JK Sharma, Mac Millan

R3) Operations Research, Anand Sharma, Himalaya Publications

 

 

 

 

 

 

V. Naga Lakshmi                                                                                                                                                   Assistant Professor                                                                                                                                                       Department of MBA, ALIET.