Operation Research detailed syllabus scheme for Computer Engineering (CS), 2019 regulation has been taken from the MU official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.
For 7th Sem Scheme of Computer Engineering (CS), 2019 Pattern, do visit CS 7th Sem Scheme, 2019 Pattern. For the Institute Level Optional Course-1 scheme of 7th Sem 2019 regulation, refer to CS 7th Sem Institute Level Optional Course-1 Scheme 2019 Pattern. The detail syllabus for operation research is as follows.
Operation Research Syllabus for Computer Engineering BE 7th Sem 2019 Pattern Mumbai University
Course Objectives:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Course Outcomes:
Learner will be able to..
- Understand the theoretical workings of the simplex method, the relationship between a linear program and its dual, including strong duality and complementary slackness.
- Perform sensitivity analysis to determine the direction and magnitude of change of a models optimal solution as the data change.
- Solve specialized linear programming problems like the transportation and assignment problems, solve network models like the shortest path, minimum spanning tree, and maximum flow problems.
- Understand the applications of integer programming and a queuing model and compute important performance measures
Module 1
Introduction to Operations Research: Introduction, , Structure of the Mathematical Model, Limitations of Operations Research Linear Programming: Introduction, Linear Programming Problem, Requirements of LPP, Mathematical Formulation of LPP, Graphical method, Simplex Method Penalty Cost Method or Big M-method, Two Phase Method, Revised simplex method, Duality, Primal – Dual construction, Symmetric and Asymmetric Dual, Weak Duality Theorem, Complimentary Slackness Theorem, Main Duality Theorem, Dual Simplex Method, Sensitivity Analysis Transportation Problem: Formulation, solution, unbalanced Transportation problem. Finding basic feasible solutions – Northwest corner rule, least cost method and Vogels approximation method. Optimality test: the stepping stone method and MODI method. Assignment Problem: Introduction, Mathematical Formulation of the Problem, Hungarian Method Algorithm, Processing of n Jobs Through Two Machines and m Machines, Graphical Method of Two Jobs m Machines Problem Routing Problem, Travelling Salesman Problem Integer Programming Problem: Introduction, Types of Integer Programming Problems, Gomorys cutting plane Algorithm, Branch and Bound Technique. Introduction to Decomposition algorithms. 14
Module 2
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Module 3
Simulation: Introduction, Methodology of Simulation, Basic Concepts, Simulation Procedure, Application of Simulation Monte-Carlo Method: Introduction, Monte-Carlo Simulation, Applications of Simulation, Advantages of Simulation, Limitations of Simulation 05
Module 4
Dynamic programming. Characteristics of dynamic programming. Dynamic programming approach for Priority Management employment smoothening, capital budgeting, Stage Coach/Shortest Path, cargo loading and Reliability problems. 05
Module 5
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Module 6
Inventory Models: Classical EOQ Models, EOQ Model with Price Breaks, EOQ with Shortage, Probabilistic EOQ Model, 05
Assessment
Internal Assessment for 20 marks: Consisting Two Compulsory Class Tests First test based on approximately 40% of contents and second test based on remaining contents (approximately 40% but excluding contents covered in Test I) End Semester Examination: Weightage of each module in end semester examination will be proportional to number of respective lecture hours mentioned in the curriculum.
- Question paper will comprise of total six questions, each carrying 20 marks
- Question 1 will be compulsory and should cover maximum contents of the curriculum
- Remaining questions will be mixed in nature (for example if Q.2 has part
- from module 3 then part
- will be from any module other than module 3)
- Only Four questions need to be solved.
Reference Books:
For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
For detail Syllabus of all subjects of Computer Engineering (CS) 7th Sem 2019 regulation, visit CS 7th Sem Subjects of 2019 Pattern.