Operations Research Part-Iii
Published 11/2024
MP4 | Video: h264, 1920x1080 | Audio: AAC, 44.1 KHz
Language: English | Size: 6.06 GB | Duration: 9h 15m
Published 11/2024
MP4 | Video: h264, 1920x1080 | Audio: AAC, 44.1 KHz
Language: English | Size: 6.06 GB | Duration: 9h 15m
Learn basic concepts of Dynamic Programming, Game theory, Inventory Model and Sequencing Model in Operations Research
What you'll learn
Dynamic Programming
Game Theory
Inventory Model
Sequencing Model
Requirements
Basic Mathematics
Basic Knowledge of Management subjects
Description
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!
Overview
Section 1: Dynamic Programming
Lecture 1 Dynamic Programming Concept
Lecture 2 Numerical-I Employment Smoothening Problem
Lecture 3 Numerical-II Capital Budgeting Problem
Lecture 4 Numerical-III Shortest Path Problem
Lecture 5 Numerical-IV Cargo Loading Problem
Section 2: Game Theory
Lecture 6 Theory of Games
Lecture 7 Characteristics of Games
Lecture 8 Game Models
Lecture 9 Pure Strategy in OR
Lecture 10 Mixed Strategy in OR
Lecture 11 Terminologies used in Game Theory
Lecture 12 Rules for Game Theory
Lecture 13 Minimax Maximin Principle
Lecture 14 Numericals-Minimax Maximin Principle
Lecture 15 Odd's Principle
Lecture 16 Numericals-Odd's Principle
Lecture 17 Dominance Principle
Lecture 18 Numerical-I Dominance Principle
Lecture 19 Numerical-II Dominance Principle
Lecture 20 Numerical-III Dominance Principle
Lecture 21 Equal Game Method
Lecture 22 Numerical- Equal Game Method
Lecture 23 Hawk vs Dove Game Model
Lecture 24 Limitation of Game Theory
Section 3: Inventory Model
Lecture 25 Inventory Model Concept
Lecture 26 Necessity for Maintaining Inventory
Lecture 27 Inventory Costs
Lecture 28 Inventory Management
Lecture 29 Inventory Control Problem
Lecture 30 ABC Analysis of Inventory
Lecture 31 Just-In-Time (JIT) Inventory
Lecture 32 Classification of Fixed Order Quantity Inventory Models
Lecture 33 Classical EOQ Model
Lecture 34 Limitation of Classical EOQ Model
Lecture 35 Numericals
Section 4: Sequencing Model
Lecture 36 Sequencing Concept
Lecture 37 Numericals on Processing n jobs on 2 machines
Lecture 38 Numerical-I on Processing n jobs on 3 machines
Lecture 39 Numerical-II on Processing n jobs on 3 machines
Lecture 40 Numerical-I on Processing 2 jobs on m machines
Lecture 41 Numerical-II on Processing 2 jobs on m machines
Lecture 42 Assumptions in Sequencing Model
B.E./BTech Students,MBA Students,Practising Engineers,Post Graduate Students i.e. M.E./MTech