1
Introduction to Operations Research. Instructor: Prof. G. Srinivasan, Department of Management Studies, IIT Madras.
FREE
This course includes
Hours of videos
1111 years
Units & Quizzes
40
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
Operations research is a field of study about optimizing performance under given constraints. Operations research also helps us develop models for decision making. The course covers topics on linear programming, graphical and algebraic solutions, simplex algorithm, duality, understanding the dual, solving LPs using solver, transportation problem and assignment problem. (from nptel.ac.in)
Course Currilcum
-
- Lecture 01 – Product Mix Problem and Notations Unlimited
- Lecture 02 – Manpower and Production Planning Formulations Unlimited
- Lecture 03 – Media Selection Problem and Bicycle Problem Unlimited
- Lecture 04 – Caterer Problem Unlimited
- Lecture 05 – Maximum Flow and Bin Packing Problems Unlimited
-
- Lecture 06 – Graphical Method (Maximization) Unlimited
- Lecture 07 – Graphical Method (Minimization) Unlimited
- Lecture 08 – Algebraic Method (Maximization) Unlimited
- Lecture 09 – Algebraic Method (Minimization) Unlimited
- Lecture 10 – Comparing Graphical and Algebraic Methods Unlimited
- Lecture 11 – Algebraic Form of Simplex Algorithm Unlimited
- Lecture 12 – Tabular Form of Simplex (Maximization) Unlimited
- Lecture 13 – Tabular Form of Simplex (Minimization) Unlimited
- Lecture 14 – Unboundedness Unlimited
- Lecture 15 – Infeasibility Unlimited
- Lecture 21 – Dual Solution using Complementary Slackness Unlimited
- Lecture 22 – Dual Solution from Simplex Table; Economic Interpretation of Dual Unlimited
- Lecture 23 – Economic Interpretation of the Dual; Dual Simplex Algorithm Unlimited
- Lecture 24 – Solving LPs with Mixed Type of Constraints Unlimited
- Lecture 25 – Matrix Method for LP Problems Unlimited
- Lecture 31 – Introducing the Assignment Problem Unlimited
- Lecture 32 – Solving the Assignment Problem Unlimited
- Lecture 33 – Hungarian Algorithm; Alternate Optimum Unlimited
- Lecture 34 – Unequal Number of Rows and Columns; Dual of the Assignment Problem Unlimited
- Lecture 35 – Optimality of the Hungarian Algorithm Unlimited
