Civil

CE-ILO7055: Operations Research Syllabus for CE 7th Sem 2019 Pattern Mumbai University (Institute Level Optional Course-1)

Operations Research detailed syllabus scheme for Civil Engineering (CE), 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 Civil Engineering (CE), 2019 Pattern, do visit CE 7th Sem Scheme, 2019 Pattern. For the Institute Level Optional Course-1 scheme of 7th Sem 2019 regulation, refer to CE 7th Sem Institute Level Optional Course-1 Scheme 2019 Pattern. The detail syllabus for operations research is as follows.

Operations Research Syllabus for Civil 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.
Get it on Google Play.

Module I

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 II

Queuing models: queuing systems and structures, single server and multiserver models, Poisson input, exponential service, constant rate service, finite and infinite population 05

Module III

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.
Get it on Google Play.

Module IV

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 V

Game Theory. Competitive games, rectangular game, saddle point, minimax (maximin) method of optimal strategies, value of the game. Solution of games with saddle points, dominance principle. Rectangular games without saddle point – mixed strategy for 2 X 2 games. 05

Module VI

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.
Get it on Google Play.

Course Outcomes:

Students 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

Assessment:

Internal: Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approximately 40% syllabus is completed and second class test when additional 40% syllabus is completed. The average marks of both the test will be considered for final Internal Assessment. Duration of each test shall be of one hour. End Semester Theory Examination In question paper, weightage of each module will be approximately proportional to number of respective lecture hours as mentioned in the syllabus.

  • Question paper will comprise of total six questioncarrying20 marks
  • Question no. 1 is compulsory. Any 3 out of remaining 5 need to be solved
  • Remaining question (Q.2 to Q.6) will be selected from all the modules.
  • Questions may be mixed in nature (for example supposed Q.2 has part
    1. from module 3 then part
    2. may be from any module other than module 3)

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.
Get it on Google Play.

For detail Syllabus of all subjects of Civil Engineering (CE) 7th Sem 2019 regulation, visit CE 7th Sem Subjects of 2019 Pattern.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.