Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
The Operations Research course by Swayam teaches an approach to solve problems that involves operation of systems using scientific techniques and tools. This course provides knowledge of techniques that can be used to solve real life problems in day to day life. Learning this course would help the candidate to manage problems in finance, healthcare, transportation, marketing and telecommunication.
This course covers concepts like linear programming, assignment problems, replacement theory, game theories, inventory theory and Queuing theory. It also wraps basic terminologies and concepts in three modes of dynamic programming.
Nonlinear programming methodologies like Lagrange multiplier methods, quadratic programming and KT conditions are also taught clearly. Learning this course would help the candidate to solve long term and short term problems very efficiently.
Special cases in transportation & assignment problems and travelling salesman problems are discussed with solutions. The entire course is divided into ten chapters with equal weightage. Each chapter has MCQ questions at the end that helps the candidate to learn every topic of the chapter very clearly.
The Highlights
- The course duration of 15 weeks
- Post Graduation level programme
- E-learning programme offering
- Credit transfer
- Certification imparted by Swayam
- Government aided course
- Certification by government
Programme Offerings
- video lectures
- Puzzles
- quizzes
- Discussion forum Assessments
- assignments
- E-texts
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| INR 1000 | yes | Jadavpur University, Kolkata |
- There is no registration fee to join the Operations Research course by Swayam.
- The candidate is entitled to make a fee payment of Rs. 1,000 for appearing in exams.
- The programme is free of cost
The fees for the course Operations Research :
Category | Amount |
Exam Fee | Rs. 1,000 |
Eligibility Criteria
Education
Candidates who are presently pursuing Post graduate in Mathematics are eligible for this programme.
Certification Qualifying Details
Candidates need to register and appear for the final examination. Once the exam is over, candidates need to pay a fee for a certificate as well.
What you will learn
This course gives a clear understanding of the candidate in areas in Operations Research field such as
- Nonlinear, Integer and Dynamic programming
- Basic characteristics of the Probability distribution of Arrivals and Queuing System
- Components of critical path method and network
- Assumptions and terminologies in job sequencing and processing
- Formulation of Graphical method for solving Big-M method and LPP
Who it is for
The Operations Research course by Swayam is specially developed for the following users
- Post Graduates in maths domain
- UG &PG Students
Admission Details
The participants can adhere to the following simple steps for registering themselves to the Operations Research course by Swayam.
Step 1: Visit the course website.
Step 2: The students can directly register if they already have an account in Swayam else they have to Sign-In.
Step 3: Note that the registration link for this programme isn’t available currently. The candidate can register when the link opens.
The Syllabus
Chapter 1 – Linear Programming Problem
- Module-1: Mathematical Formulation of LPP and Graphical Method for Solving LPP
- Module-2: Simplex Method for Solving LPP and Big-M Method
Chapter 1 – Linear Programming Problem
- Module-3: Some Special Cases in LPP
- Module-4: Duality, and Solving LPP using Duality in Simplex Method
- Module-5: Dual Simplex Method and Revised Simplex Method
Chapter 2 – Transportation and Assignment Problems
- Module-1: Mathematical Formulation and Initial BFS of Transportation Problem
- Module-2: Optimality Test by Stepping Stone Method and MODI Method, and Some Special Cases of Transportation Problem
- Module-3: Assignment Problem and Its Solution by Hungarian Method, and Travelling Salesman Problem
Chapter 3 – Game Theory
- Module-1: Basic Concept and Terminologies, Two-person Zero-sum Game, and Game with Pure and Mixed Strategies
- Module-2: Dominance Principle, Arithmetic Method, and Graphical Method for Solving (2× n) Game
- Module-3: Graphical Method for Solving (m×2) Game and Solution of Game by Simplex Method
Chapter 4 – Job Sequencing and Replacement Theory
- Module-1: Basic Terminologies and Assumptions of Job Sequencing, and Processing of n Jobs through 2 and 3 Machines
- Module-2: Processing n Jobs through m Machines, and Processing 2 Jobs through m Machines - Graphical Method
- Module-3: Introduction to Replacement Theory and Determination of Optimal Replacement Time
- Module-4: Selection of the Best Machine, and Individual and Group Replacement Policies
Chapter 5 – Inventory Theory
- Module-1: Economic Order Quantity and EOQ Models without Shortage
- Module-2: EOQ models with Shortage and EPQ Models with/without Shortages
Chapter 5 – Inventory Theory
- Module-3: Multi-item Inventory Models, Purchase Inventory Model, and Inventory Models with Price Breaks
- Module-4: Newsboy Problem and Probabilistic Inventory Model with Instantaneous Demand and No Set up Cost
- Module-5: Probabilistic Inventory Model with Uniform Demand and No Set up Cost, and Buffer Stock in Probabilistic Inventory Model
Revision, Assignment and Evaluation
Chapter 6 – Queuing Theory
- Module-1: Basic Characteristics of Queuing System and Probability Distribution of Arrivals
- Module-2: Probability Distribution of Departures and Model I (M|M|1):(∞|FCFS)
- Module-3: Model I. (General): (M|M|1): (∞|FCFS), and Model II. (M|M|1): (N|FCFS)
- Module-4: Model III - (M|M|s): (∞|FCFS), and Model IV - (M|Ek|1): ( ∞|FCFS)
Chapter 7 – Network Analysis
- Module-1: Basic Components of Network and Critical Path Method (CPM)
- Module-2: Total Float and Free Float of Activity, and CPM Model: Time-cost Optimization
Chapter 7 – Network Analysis
- Module-3: Program Evaluation and Review Technique (PERT)
- Module-4: LP and Dual LP Solutions to Network Problem
Chapter 8 – Dynamic Programming
- Module-1: Basic Concept and Terminology, and Dynamic Programming Models I and II
- Module-2: DP Model III, Solution of Discrete DP Problem and Solution of LPP by DP
Chapter 9 – Integer Programming
- Module-1: Introduction to Integer Programming, and Gomory's Cutting Plane Method for All IPP
- Module-2: Gomory's Cutting Plane Method for Mixed IPP, and Branch and Bound Method
Chapter 10 – Nonlinear Programming
- Module-1: NLPP with Equality Constraints: Lagrange Multiplier Method
- Module-2: NLPP with Inequality Constraints: Kuhn-Tucker (KT) Conditions, and Quadratic Programming
- Module-3: Wolfe's Modified Simplex Method and Beale's Method
Revision, Assignment and Evaluation
Evaluation process
Details regarding the exam will be available when the registration form for the exam is published.