
This video explains the concept of Dynamic Programming
This video explains a numerical on Employment Smoothening Problem of Dynamic Programming.
This video explains a numerical on Capital Budgeting Problem of Dynamic Programming.
This video explains a numerical on Shortest Path Problem of Dynamic Programming.
This video explains a numerical on Cargo Loading Problem.
This video explains the concept of Game Theory.
This video explains the Characteristics of Games in Game Theory.
This video explains the various Games Models in Game Theory.
This video explains the Pure Strategy in OR.
This video explains the Mixed Strategy in OR.
This video explains the Terminologies used in Game Theory.
This video explains Rules for Game Theory.
This video explains the Minimax Maximin Principle.
This video explains a numerical on Minimax-Maximin Theory of Game Theory.
This video explains the Odd's Principle.
This video explains a numerical on Odd's Principle of Game Theory.
This video explains the Dominance Principle in Game Theory
This video explains a numerical on Dominance Principle of Game Theory.
This video explains a numerical on Dominance Principle of Game Theory.
This video explains a numerical on Dominance Principle of Game Theory.
This video explains the concept of Equal Game Method.
This video explain numerical on Equal Game Method.
This video explains the concept of Hawk vs Dove Game Model.
This video explains the concept of Limitation of Game Theory.
This video explains the concept of Inventory Model.
This video explains the concept of Necessity for Maintaining Inventory.
This video explains the concept of Inventory Costs.
This video explains the concept of Inventory Management.
This video explains the concept of Inventory Control Problem.
This video explains the concept of ABC Analysis of Inventory.
This video explains the concept of Just-In-Time (JIT) Inventory.
This video explains the concept of Classification of Fixed Order Quantity Inventory Models.
This video explains the concept of Classical EOQ Model.
This video explains the concept of Limitation of Classical EOQ Model.
This video explains the numericals on Classical EOQ Model.
This video explains the concept of Sequencing.
This video explains the Numericals on Processing n jobs on 2 machines.
This video explains the Numerical on Processing n jobs on 3 machines.
This video explains the Numerical on Processing n jobs on 3 machines.
This video explains the Numerical on Processing 2 jobs on m machines.
This video explains the Numerical on Processing 2 jobs on m machines.
This video explains the concept of Assumptions in Sequencing Model.
This course is the third part of the lecture series of Operations Research course. It takes you through various topics like Dynamic Programming, Game theory, Inventory Model and Sequencing Model. Various numerical are solved to explain the concepts and their applications. Basic Mathematics and Basic Knowledge of Management subjects are the requirement for understanding of this subject.
We start with Dynamic Programming and then discuss about the concept and numericals on Employment Smoothening Problem, Capital Budgeting Problem, Shortest Path Problem and Cargo Loading Problem.
Further, we move to the concept of Game theory and then discuss about Theory of Games, Characteristics of Games, Game Models, Pure and Mixed Strategy in OR, Terminologies used in Game Theory, Rules for Game Theory, Minimax Maximin Principle, Odd's Principle, Dominance Principle, Equal Game Method, Hawk vs Dove Game Model and Limitation of Game Theory. Further there are numericals discussed on few of the topics.
Third section deals with Inventory Model. Here concepts like Necessity for Maintaining Inventory, Inventory Costs, Inventory Management, Inventory Control Problem, ABC Analysis of Inventory, Just-In-Time (JIT) Inventory, Classification of Fixed Order Quantity Inventory Models, Classical EOQ Model and Limitation of Classical EOQ Model are discussed. Numericals are solved for the Classical EOQ Model.
Lastly Sequencing Model is discussed in theory and numericals form. Numericals on n jobs on 2 machines, n jobs on 3 machines and 2 jobs on m machines are solved.
Happy Learning!