Log In / Register

Virtual University of Pakistan

Find Course


Featured Courses

Home > Courses > Mathematics > MTH601

MTH601 : Operations Research

Course Overview

Course Synopsis

This course presents the principles and techniques for solving Decision-making problems in the industry using Mathematical Models. It is the science of planning and executing operations to make the most economical use of resources available, also known as Management Science. The operation can be as simple as making a cup a tea as complicated as planning the movement of a fleet of tankers around the world. The techniques include Decision Analysis, Linear Programming, Transportation model, Assignment Model, Network Model, and Forecasting. The course emphasizes the process of model development and solution analysis.

Course Learning Outcomes

By the end of the course, students should be able:

  • To formulate a decision-making problem and apply the method of depicting a series of decisions and outcomes by decision trees.
  • To formulate the problems into mathematical model and apply the quantitative methods (graphical method and simplex method) for maximization and minimization problems
  • To formulate the transportation and assignment problems and apply the transportation simplex and Hungarian methods.
  • To define the concept of network analysis, develop the network diagram and perform network analysis.
  • To identify different types of forecast, to measure forecast accuracy and apply time-series forecasting models

Course Calendar

1 Introduction
2 OR Process
3 OR Techniques and Applications
4 Fundamental Concepts and Applications
5 Construction of Networks
6 Activities, Times and Floats
7 To find Critical Path
8 To find Critical Path
9 CPM Model and PERT Model
Quiz-01 from Lecture 03-09
10 Resource Leveling
11 Inventory Costs and Economic Order Quantities
12 Purchasing Model with no Shortages
13 Purchasing Models with Shortages
14 Manufacturing Model with no Shortages
15 Manufacturing Model with Shortages
Assignment-01 from Lecture 01-15
16 Revision and Analysis
17 Introduction to Linear Programming
18 Formation of Linear Programming problems
19 (Continue) Formation of Linear Programming problems
20 Solution Methods of Linear Programming problems (Graphical)
Quiz-02 from Lecture 10-18
21 Simplex Method
22 (Continue) Simplex Method
Midterm Exams from Lecture 01-22
23 Big M and Two Phase Methods
24 (Continue) Big M and Two Phase Methods
25 Two Phase Method
26 Variants of the Simplex Methods
27 (Continue) Variants of the Simplex Methods
28 (Continue) Variants of the Simplex Methods
Quiz-03 from Lecture 21-26
29 Duality Theory (Dual and Primal problems)
30 Post-Optimality or Sensitivity Analysis
31 Transportation Problems
32 Lecture # 32
33 Lecture # 33
Quiz-04 from Lecture 30-33
34 Lecture # 34
35 Lecture # 35
36 Assignments Problems
37 Lecture # 37
38 Queuing Theory
39 Lecture No 39
40 Replacement Models
41 Lecture # 41
42 Dynamic Programming
43 Lecture # 43
44 Miscellaneous
45 Lecture # 45
Final Term Exams from Lecture 19-45 Tantive
facebook        facebook        facebook
  

© 2011 Virtual University of Pakistan.
Developed by IT Department, Virtual University of Pakistan.