About Course
This Operations Research course is focused on the application of linear programming techniques. Most of the mathematical models presented in the course are The course includes discussions of the simplex algorithm and other methods to derive solutions for the above models. The Excel Solver software is also used in the course to solve linear programming problems. Discussions (Sensitivity Analysis) are included as to how changes or variations in linear programming parameters affect the optimal solution.
Who this course is for:
- Students of Mathematics, Engineering, and Business
- Operations Engineers
- Production leaders
- Business Analysts
- Business Office Executives
Course Content
Operations Research
-
Introduction of Operations Research
00:00 -
Linear Programming Problem
00:00 -
Linear Programming Problem – 2
00:00 -
Linear Programming Problem – 3
00:00 -
Linear Programming Problem – 4
00:00 -
OR-LPP/Graphical-1
00:00 -
OR-LPP/Graphical-2
00:00 -
OR-LPP/Graphical-3
00:00 -
OR-LPP/Graphical-4
00:00 -
OR-LPP/Graphical-5
00:00 -
OR-LPP/Graphical-6
00:00 -
OR-LPP/Graphical-7
00:00 -
OR-Transportation-1
00:00 -
OR-Transportation-2
00:00 -
OR-Transportation-3
00:00 -
OR-Transportation-4
00:00 -
OR-Transportation-5
00:00 -
OR-Transportation-6
00:00 -
OR-Transportation-7
00:00 -
Assignment – Introduction
00:00 -
PERT CPM: Example – 1 | Topic: Slacks and floats explained
00:00 -
PERT CPM: Example – 2 || Topic: Slacks and floats explained
00:00 -
PERT CPM: Example – 3 || Topic: How to make a PERT/CPM Network
00:00 -
PERT CPM: Example – 4 || Topic: How to make a PERT/CPM Network
00:00 -
Draft Lesson
-
PERT CPM: Example – 5 || Topic: Slacks and floats explained
00:00 -
PERT CPM: Example – 6 || Topic: How to make a PERT/CPM Network
00:00 -
PERT CPM: Example – 7 || Topic: How to make a PERT/CPM Network
00:00 -
PERT CPM: Example – 8(a) || Topic: How to make a PERT/CPM Network
00:00 -
PERT CPM: Example – 8(b) || Topic: Slacks and floats explained
00:00 -
Decision Making Under Uncertainty
00:00 -
Data Envelopment Analysis
00:00 -
Data Envelopment Analysis – 2
00:00 -
DEA using MS Excel – 1
00:00 -
DEA using MS Excel – 2
00:00 -
Introduction of Sequencing/Scheduling
00:00 -
Sequencing/Scheduling of ‘n’ jobs on ‘2’ machines
00:00 -
SIM-1: Solving a Linear Problem using Simplex
00:00 -
SIM-2: Simplex Method to Solve Linear problem
00:00 -
SIM-3: Maximization of a Linear problem (LPP) using Simplex Method
00:00 -
SIM-4: Big-M Method to solve Linear Problem containing constraints with Greater Than type inequality
00:00 -
SIM-5: Big-M Method in Simplex
00:00 -
SIM-6: Big-M Method in Simplex to Minimize a Problem
00:00 -
SIM-7: Auxiliary Function in Two Phase Method in Simplex to solve a Linear Programming Problem (LPP)
00:00 -
SIM-8: Two Phase Method in Simplex to minimize a Linear Programming Problem (LPP)
00:00 -
SIM-9: Two Phase Method in Simplex to Maximize a Linear Programming Problem (LPP)
00:00 -
SIM-10: Maximization of a Linear Problem using Simplex having 3 variables and 3 constraints
00:00 -
SIM-11: Simplex special case with only one variable in greater than type constraint
00:00 -
SIM-12: Simplex special case with multiple greater than type constraints having only one variable
00:00 -
OR-GT-1 | Game Theory
00:00 -
OR-GT-2 | Solution of a Stable Game
00:00 -
OR-GT-3 | Solution of a Game of size mxn
00:00 -
OR-GT-4 | Oddoment Method to solve an Unstable Game of order 2×2
00:00 -
OR-GT-5 | Algebric Method to solve an Unstable Game of order 2×2
00:00 -
OR-GT-6 | Dominance in Game Theory
00:00 -
OR-GT-7 | Pure or Direct or Absolute Dominance in Game Theory
00:00 -
OR-GT-8 | Dominance in Game Theory
00:00
Student Ratings & Reviews
No Review Yet