- Home
- Courses
- Engineering
- Agricultural Engineering
- Advanced Operations Research
Curriculum
- 1 Section
- 39 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Advanced Operations Research39
- 2.1Lecture 1 – Introduction & Linear Programming
- 2.2Lecture 2 – Revised Simplex Algorithm
- 2.3Lecture 3 – Simplex Method for Bounded Variables
- 2.4Lecture 4 – One Dimensional Cutting Stock Problem Part 1
- 2.5Lecture 5 – One Dimensional Cutting Stock Problem Part 2
- 2.6Lecture 6 – Dantzig-Wolfe Decomposition Algorithm
- 2.7Lecture 7 – Dantzig-Wolfe Decomposition Algorithm Primal- Dual Algorithm
- 2.8Lecture 8 – Primal-Dual Algorithm
- 2.9Lecture 9 – Goal Programming- Formulations
- 2.10Lecture 10 – Goal Programming Solutions Complexity of Simplex Algorithm
- 2.11Lecture 11 – Complexity of Simplex Algorithm: Integer Programming
- 2.12Lecture 12 – Integer Programming-Formulations
- 2.13Lecture 13 – Solving Zero-One Problems Part 1
- 2.14Lecture 14 – Solving Zero-One Problems Part 2
- 2.15Lecture 15 – Branch & Bond Algorithm for Integer Programming
- 2.16Lecture 16 – Cutting Plane Algorithm
- 2.17Lecture 17 – All Integer Primal Algorithm
- 2.18Lecture 18 – All Integer Dual Algorithm
- 2.19Lecture 19 – Network Models
- 2.20Lecture 20 – Shortest Path Problem
- 2.21Lecture 21 – Successive Shortest Path Problem
- 2.22Lecture 22 – Maximum Flow Problem
- 2.23Lecture 23 – Minimum Cost Flow Problem
- 2.24Lecture 24 – Traveling Salesman Problem (TSP)
- 2.25Lecture 25 – Branch and Bound Algorithms for TSP
- 2.26Lecture 26 – Heuristics for TSP Part 1
- 2.27Lecture 27 – Heuristics for TSP Part 2
- 2.28Lecture 28 – Chinese Postman Problem
- 2.29Lecture 29 – Vehicle Routeing Problem
- 2.30Lecture 30 – Queueing Models
- 2.31Lecture 31 – Single Server Queueing Models
- 2.32Lecture 32 – Multiple Server Queueing Models
- 2.33Lecture 33 – Game Theory
- 2.34Lecture 34 – Critical Path Method
- 2.35Lecture 35 – Quadratic Programming
- 2.36Lecture 36 – Integer Programming
- 2.37Lecture 37 – All Integer Dual Algorithm
- 2.38Lecture 38 – Mixed Integer Linear Programming
- 2.39Lecture 39 – Benders Partitioning Algorithm