Advanced Operations Research
- Sciences
- 900 level
- 1 credit unit
- 289 pages
- 17 units
This course, Advanced Operations Research, builds upon basic concepts to introduce advanced techniques for solving complex management problems. It covers linear programming, integer programming, dynamic programming, goal programming, transportation models, assignment models, inventory models, network analysis, queuing theory, replacement theory, and game theory. The course aims to equip students with mathematical and practical skills for optimizing resource allocation and decision-making in various real-world scenarios.
About this course
- Difficulty
- Intermediate
- Study hours
- 150 hours
- Maths
- Intermediate
- Content
- Theoretical, practical, problem solving
- Practical work
- Yes
- Assignments
- Self Assessment Exercises
- Tutor Marked Assignments
- Final Examination
What you'll read
The real module and unit structure of CIT906, taken from the course material NOUN publishes.
One paragraph, so you can see how it reads
CIT906 · UNIT 1: CONCEPTS OF OPERATIONS RESEARCH
This course requires you to spend quality time to read. Whereas the content of this course is quite comprehensive, it is presented in clear language with lots of illustrations that you can easily relate to. The presentation style is qualitative and descriptive. This is deliberate and it is to ensure that your attention in the course content is sustained.
What you should be able to do
- Formulate and solve linear programming problems using graphical and simplex methods.
- Apply integer programming techniques to problems requiring integer solutions.
- Utilize dynamic programming to solve sequential decision-making problems.
- Apply goal programming to problems with multiple, conflicting objectives.
- Model and solve transportation and assignment problems.
- Analyze inventory systems and determine optimal ordering policies.
- Apply network analysis techniques to project scheduling and resource allocation.
- Analyze queuing systems and optimize service levels.
- Apply replacement theory to determine optimal replacement policies.
- Apply game theory to analyze competitive strategies.
What it prepares you for
- Operations Analyst
- Management Analyst
- Logistics Manager
- Supply Chain Analyst
- Project Manager
- Manufacturing
- Logistics
- Supply Chain Management
- Healthcare
- Finance
- Telecommunications
- Linear Programming Solvers
- Spreadsheet Software
- Simulation Software
Where it gets hard
The units students slow down on, and what makes each one heavy.
- Module 1: Linear Programming in Operation Research
Unit 4: Linear Programming (2)
Simplex method requires careful attention to detail and can be computationally intensive, especially with larger problems.
- Module 2: Operation Research Techniques
Unit 2: The Concept of Dynamic Programming
Dynamic programming requires understanding recursive relationships and optimal substructure, which can be challenging for some students.
- Module 3: Operation Research Modelling
Unit 4: Waiting Line (Queuing) Theory
Queuing theory involves understanding probability distributions and applying them to real-world service systems, which requires strong analytical skills.
A suggested way through it
13 weeks, about 40 hours in total. Yours will differ.
- Week 1Module 1: Linear Programming in Operation Research
Unit 1: Concepts of Operations Research · 2 hours
Read the introduction to Operations Research.. Understand the historical development of Operations Research.. Describe the scientific nature of Operations Research.. Identify the importance and uses of Operations Research.. State the limitations of Operations Research..
- Week 2Module 1: Linear Programming in Operation Research
Unit 2: Modeling · 2 hours
Understand the meaning of model in Operations Research.. Describe the various types of models.. Describe how to construct a model.. State some standard Operations Research models..
- Week 3Module 1: Linear Programming in Operation Research
Unit 3: Linear Programming (1) · 3 hours
Understand the usefulness of linear programming in Operations Research.. State the properties of a linear programming model.. Identify some areas of application of linear programming.. State how to formulate a linear programming model.. State the usual assumptions of a linear programming model.. Describe how to solve a two-variable linear programming model graphically..
- Week 4Module 1: Linear Programming in Operation Research
Unit 4: Linear Programming (2) · 3 hours
Prepare LPP for use of simplex.. Explain the need and uses of simplex.. List the steps involved in using a simplex method.. Prepare a simplex table and explain its various components.. Demonstrate the use of simplex method for solving an LLP.. State how to solve LPP using maximization problem..
- Week 5Module 1: Linear Programming in Operation Research
Unit 5: Linear Programming (3) · 3 hours
Explain optimal dual concept.. List the dual formulation procedure.. Interpret dual programming model.. State how to solve LP problems using duality..
- Week 6Module 2: Operation Research Techniques
Unit 1: Concept of Integer Programming · 2 hours
Explain the limitations of integer programming.. Identify the methods of integer programming.. Formulate integer programming model.. State how to solve IP problems using branch and bond method..
- Week 7Module 2: Operation Research Techniques
Unit 2: The Concept of Dynamic Programming · 2 hours
Explain the terminologies used in dynamic programming.. Identify the methods of dynamic programming.. Formulate dynamic programming model.. State how to solve dynamic programming problems using branch and bound method..
- Week 8Module 2: Operation Research Techniques
Unit 3: Concept of Goal Programming · 2 hours
Explain the concept of goal programming.. Use multiple goals as goal programming problems.. Formulate goal programming model.. State how to solve goal programming problems graphically..
- Week 9Module 2: Operation Research Techniques
Unit 4: Transportation Model · 3 hours
Discuss the limitations of integer programming.. Identify the methods of integer programming.. Formulate integer programming model.. State how to solve IP problems using branch and bond method..
- Week 10Module 2: Operation Research Techniques
Unit 5: Assignment Model · 3 hours
Explain the concept of assignment model.. State how to solve assignment by enumeration method.. State how to solve assignment by Hungarian method..
- Week 11Module 3: Operation Research Modelling
Unit 1: Inventory Model · 3 hours
Explain the concept of inventory.. Identify different types of inventory.. State the main reason for holding stock.. Define some important terminologies.. Identify the different EOQ model.. Determine the EOQ graphically and by use of model.. Differentiate the types of inventory control systems.
- Week 12Module 3: Operation Research Modelling
Unit 2: Network Analysis · 3 hours
Define a network model.. Explain what a project is.. Differentiate between Programme Evaluation and Review Techniques (PERT) and the Critical Path Analysis (CPA)..
Unit 3: Sequencing Problems · 3 hours
Describe the concept of sequencing.. State the assumptions made in the sequencing problem.. Define the terminologies used in sequencing problem.. Perform "Processing job through different number of machines".. Perform "Processing of two job through m machines and n job through m machines"..
- Week 13Module 3: Operation Research Modelling
Unit 4: Waiting Line (Queuing) Theory · 3 hours
Appreciate situations in which queuing problems are generated.. Learn how to set objectives for the operation of queuing.. Explain standard queuing language and symbols.. Discuss operating characteristics of queuing.. Solve queuing problems in single-channel and multiple-channel situations.. List the advantages and limitations of queuing systems..
Unit 5: Replacement Theory · 3 hours
Explain that depreciable assets have to be replaced.. Formulate assumption of Replacement Theory.. Devise a replacement policy for such items whose maintenances cost increases with time and also the money value changes with time (at constant rate).. Explain the mechanism of system failing suddenly.. Discuss group replacement policy..
Preparing for the exam
- Focus on understanding the underlying principles of each technique.
- Practice formulating real-world problems into mathematical models.
- Review and practice solving numerical examples for each technique.
- Create a cheat sheet summarizing key formulas and algorithms.
- Work through past exam papers to identify common question types.
- Prioritize studying based on the weightage of each module in the exam.
- Create concept maps linking Units 3-5 database concepts
- Practice SQL queries from Units 7-9 weekly
Questions students ask about this course
What is CIT906 about?
This course, Advanced Operations Research, builds upon basic concepts to introduce advanced techniques for solving complex management problems. It covers linear programming, integer programming, dynamic programming, goal programming, transportation models, assignment models, inventory models, network analysis, queuing theory, replacement theory, and game theory. The course aims to equip students with mathematical and practical skills for optimizing resource allocation and decision-making in various real-world scenarios.
How many units does CIT906 have?
CIT906, Advanced Operations Research, has 17 units across 4 modules, over 289 pages of course material. You can read it one unit at a time.
How many credit units is CIT906?
CIT906 carries 1 credit unit, at 900 level in Sciences.
Is CIT906 hard?
CIT906 is rated intermediate level, with intermediate mathematical content. It is mostly theoretical, practical and problem solving work, and it has a practical component.
How long does CIT906 take to study?
About 150 hours of study, spread across its 17 units.
How is CIT906 assessed?
CIT906 is assessed by Assignments, Self Assessment Exercises, Tutor Marked Assignments and Final Examination.
What can I do with CIT906?
Operations Analyst, Management Analyst, Logistics Manager, Supply Chain Analyst and Project Manager.