Mechanical - Advanced Operations Research (English)

   Friday, February 14, 2025   

Starting a new Lecture Notes Series on Mechanical - Advanced Operations Research

Youtube Lecture Playlist Credits 

Channel Name: nptelhrd

So Let Us Start to This Journey of Learning 

Mechanical - Advanced Operations Research By Lecture Notes together!

Lecture 1: Lec-1 Introduction and Linear Programming

Lecture 2: Lec-2 Revised Simplex Algorithm

Lecture 3: Lec-3 Simplex Method for Bounded Variables

Lecture 4: Lec-4 One Dimensional Cutting Stock Problem

Lecture 5: Lec-5 One Dimensional Cutting Stock Problem(Contd)

Lecture 6: Lec-6 Dantzig-Wolfe Decomposition Algorithm

Lecture 7: Lec-7 Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm

Lecture 8: Lec-8 Primal-Dual Algorithm

Lecture 9: Lec-9 Goal Programming-Formulations

Lecture 10: Lec-10 Goal Programming Solutions Complexity of Simplex Algorithm

Lecture 11: Lec-11 Complexity of Simplex Algorithm(Contd) Integer Programming

Lecture 12: Lec-12 Integer Programming-Formulations

Lecture 13: Lec-13 Solving Zero-One Problems

Lecture 14: Lec-14 Solving Zero-One Problems(Contd)

Lecture 15: Lec-15 Branch And Bond Algorithm For Integer Programming

Lecture 16: Lec-16 Cutting Plane Algorithm

Lecture 17: Lec-17 All Integer Primal Algorithm

Lecture 18: Lec-18 All Integer Dual Algorithm

Lecture 19: Lec-19 Network Models

Lecture 20: Lec-20 Shortest Path Problem

Lecture 21: Lec-21 Successive Shortest Path Problem

Lecture 22: Lec-22 Maximum Flow Problem

Lecture 23: Lec-23 Minimum Cost Flow Problem

Lecture 24: Lec-24 Traveling Salesman Problem(TSP)

Lecture 25: Lec-25 Branch and Bound Algorithms for TSP

Lecture 26: Lec-26 Heuristics for TSP

Lecture 27: Lec-27 Heuristics for TSP(Contd)

Lecture 28: Lec-28 Chinese Postman Problem

Lecture 29: Lec-29 Vehicle Routeing Problem

Lecture 30: Lec-30 Queueing Models

Lecture 31: Lec-31 Single Server Queueing Models

Lecture 32: Lec-32 Multiple Server Queueing Models

Lecture 33: Lec-33 Game Theory

Lecture 34: Lec-34 Critical Path Method

Lecture 35: Lec-35 Quadratic Programming

Lecture 36: Lec 36 - Integer Programming(continued)

Lecture 37: Lec 37 - All Integer Dual Algorithm

Lecture 38: Lec 38 - Mixed Integer Linear Programming

Lecture 39: Lec 39 - Benders Partitioning Algorithm