0(0)

Operations Research

  • Course level: Intermediate
  • Categories C-Science
  • Last Update 24/06/2021

Description

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:

  1. Students of Mathematics, Engineering, and Business
  2. Operations Engineers
  3. Production leaders
  4. Business Analysts
  5. Business Office Executives

What Will I Learn?

  • Linear programming
  • Mathematical Modeling
  • Business Cost Optimization
  • Methods for Maximizing Profit and Minimizing Cost
  • Cost Sensitivity Analysis
  • Network and Transportation optimization

Topics for this course

57 Lessons

Operations Research

Introduction of Operations Research00:00:00
Linear Programming Problem00:00:00
Linear Programming Problem – 200:00:00
Linear Programming Problem – 300:00:00
Linear Programming Problem – 400:00:00
OR-LPP/Graphical-100:00:00
OR-LPP/Graphical-200:00:00
OR-LPP/Graphical-300:00:00
OR-LPP/Graphical-400:00:00
OR-LPP/Graphical-500:00:00
OR-LPP/Graphical-600:00:00
OR-LPP/Graphical-700:00:00
OR-Transportation-100:00:00
OR-Transportation-200:00:00
OR-Transportation-300:00:00
OR-Transportation-400:00:00
OR-Transportation-500:00:00
OR-Transportation-600:00:00
OR-Transportation-700:00:00
Assignment – Introduction00:00:00
PERT CPM: Example – 1 | Topic: Slacks and floats explained00:00:00
PERT CPM: Example – 2 || Topic: Slacks and floats explained00:00:00
PERT CPM: Example – 3 || Topic: How to make a PERT/CPM Network00:00:00
PERT CPM: Example – 4 || Topic: How to make a PERT/CPM Network00:00:00
Draft Lesson
PERT CPM: Example – 5 || Topic: Slacks and floats explained00:00:00
PERT CPM: Example – 6 || Topic: How to make a PERT/CPM Network00:00:00
PERT CPM: Example – 7 || Topic: How to make a PERT/CPM Network00:00:00
PERT CPM: Example – 8(a) || Topic: How to make a PERT/CPM Network00:00:00
PERT CPM: Example – 8(b) || Topic: Slacks and floats explained00:00:00
Decision Making Under Uncertainty00:00:00
Data Envelopment Analysis00:00:00
Data Envelopment Analysis – 200:00:00
DEA using MS Excel – 100:00:00
DEA using MS Excel – 200:00:00
Introduction of Sequencing/Scheduling00:00:00
Sequencing/Scheduling of ‘n’ jobs on ‘2’ machines00:00:00
SIM-1: Solving a Linear Problem using Simplex00:00:00
SIM-2: Simplex Method to Solve Linear problem00:00:00
SIM-3: Maximization of a Linear problem (LPP) using Simplex Method00:00:00
SIM-4: Big-M Method to solve Linear Problem containing constraints with Greater Than type inequality00:00:00
SIM-5: Big-M Method in Simplex00:00:00
SIM-6: Big-M Method in Simplex to Minimize a Problem00:00:00
SIM-7: Auxiliary Function in Two Phase Method in Simplex to solve a Linear Programming Problem (LPP)00:00:00
SIM-8: Two Phase Method in Simplex to minimize a Linear Programming Problem (LPP)00:00:00
SIM-9: Two Phase Method in Simplex to Maximize a Linear Programming Problem (LPP)00:00:00
SIM-10: Maximization of a Linear Problem using Simplex having 3 variables and 3 constraints00:00:00
SIM-11: Simplex special case with only one variable in greater than type constraint00:00:00
SIM-12: Simplex special case with multiple greater than type constraints having only one variable00:00:00
OR-GT-1 | Game Theory00:00:00
OR-GT-2 | Solution of a Stable Game00:00:00
OR-GT-3 | Solution of a Game of size mxn00:00:00
OR-GT-4 | Oddoment Method to solve an Unstable Game of order 2×200:00:00
OR-GT-5 | Algebric Method to solve an Unstable Game of order 2×200:00:00
OR-GT-6 | Dominance in Game Theory00:00:00
OR-GT-7 | Pure or Direct or Absolute Dominance in Game Theory00:00:00
OR-GT-8 | Dominance in Game Theory00:00:00
Operations Research
35 £

Enrolment validity: Lifetime

Requirements

  • Basic Linear Algebra