Scribd
Upload
132 views2 pages

Mat2004 Operation-Research LT 1.0 1 Mat2004

This document summarizes an Operations Research course offered at an unknown institution. The 3 credit course aims to teach concepts of operations research applied to business decision making. Over 45 hours, students will learn techniques like linear programming, integer programming, dynamic and non-linear programming, game theory, queuing models and network scheduling. Assessment includes digital assignments, tests, and open book exams. The course is taught using flipped classroom, video lectures and digital models. Guest lectures will also cover contemporary topics in operations research.

Uploaded by

ARYAN SHUKLA 20BCE10356
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
132 views2 pages

Mat2004 Operation-Research LT 1.0 1 Mat2004

This document summarizes an Operations Research course offered at an unknown institution. The 3 credit course aims to teach concepts of operations research applied to business decision making. Over 45 hours, students will learn techniques like linear programming, integer programming, dynamic and non-linear programming, game theory, queuing models and network scheduling. Assessment includes digital assignments, tests, and open book exams. The course is taught using flipped classroom, video lectures and digital models. Guest lectures will also cover contemporary topics in operations research.

Uploaded by

ARYAN SHUKLA 20BCE10356
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Operations Research Course LT

MAT2004 Type
Credits 3
Course Objectives:
 To learn the concepts of Operations Research applied in business decision making

Course Outcomes:
At the end of the course, students will be able to
 facilitate quantitative solutions in business decision making under conditions of certainty,
risk and uncertainty.
Student Outcomes (SO): a,ej,k
Module Module Content Hrs. SO
No.
1 Linear Programming Problems 7 a,e,j,k
Formulation of linear programming problem – Simplex method –
Big-M method – Two Phase method-Dual simplex method –
Revised simplex method – Duality.

2 Integer Programming and Allocation Problems 9 a,e,j,k


Formulation of Integer Programming Problem – Pure and Mixed
Integer Programming Problems – Cutting-Plane Algorithm –
Branch & Bound Algorithm. Transportation problem – Methods of
basic feasible solution – Optimal solution – MODI Method.
Assignment problem – Hungarian method-Travelling Salesman
problem
3 Dynamic and Non-Linear Programming Problems 9 a,e,j,k
Dynamic Programming – Principle of optimality- Optimal Sub-
division problem – Shortest path problem – Solution of LPP by
dynamic programming. Non-Linear Programming Problem –
Kuhn-Tucker conditions – Wolfe’s modified simplex method.
4 Game Theory and Job Shop Scheduling 9 a,e,j,k
Basic Terminologies of Game theory – Two Person Zero Sum
Games – The Maximin - Minimax principle – Game with pure and
mixed Strategies – Dominance property – Simplex method. Job
Shop Scheduling: Processing n jobs through Two Machines –
Processing n Jobs through k Machines – Processing Two Jobs
through k Machines.
5 Queuing Models and Network Scheduling 9 a,e,j,k
Queuing models –Poisson arrivals and Exponential service times
– Single channel models and Multichannel models. Network
scheduling: Guidelines for network construction – Critical Path
Method (CPM) –Project Evaluation and Review Technique (PERT)
- Critical Path Scheduling – Probability and Cost consideration in
PERT.
6 Guest Lectures by experts on contemporary topics 2
Total 45
Mode of Teaching and Learning: Flipped Class Room, Video Lectures, Digital/Computer based
models to augment lecture for practice/tutorial, 2 hours lectures by industry experts on
contemporary topics
Mode of Evaluation and assessment: Digital Assignments, Continuous Assessment Tests,
Final Assessment Test and unannounced open book examinations, quizzes, student’s portfolio generation
and assessment, innovative assessment practices
Text Book(s):
1. Hamdy A Taha, Introduction to Operations Research, Prentice Hall India, Fourth
Edition, Third Indian Reprint 2004
2. Pradeep Prabakar Pai, Operations Research - Principles and Practice, Oxford Higher
Education
3 S. S. Rao, Engineering Optimization Theory and Practice, Wiley Eastern Ltd., 2004.

Reference Book(s):
1. Hiller and Lieberman, Introduction to the Operations Research (8th Edition), Tata McGraw-
Hill Publishers.

2. Gupta P.K, Hira D.S, Problem in Operations Research, S.Chand and Co, 2007.

3. S. D. Sharma, Operations Research, Kedamanth Ramnath & Co., 2006.


Recommendation by the Board of Studies on 22-4-2017
Approval by Academic council on
Compiled by Dr.C.Vijayalakshmi & Dr.V.Prabhakar

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy