Skip to main content

Ctrl+K

Contents

Lecture 1: Introduction
Lecture 2: Five-Step Process
Lecture 3: Problem Types
Lecture 4: Linear Programming
Lecture 5: Graphical Solution Method
Lecture 6: Graphical Solution Method
Lecture 7: Assignment 1 Discussion
Lecture 8: Spreadsheet-based Solution Method
Lecture 9: Basic Linear Algebra
Lecture 10: Simplex Method
Lecture 11: Sensitivity Analysis
Lecture 12: Duality
Lecture 13: Assignment 2 Discussion
Lecture 14: Quiz-I Discussion
Lecture 15: Python Programming
Lecture 16: Transportation Problem
Lecture 17: Transshipment Problem
Lecture 18: Minimum Spanning Tree Problem
Lecture 19: Maximum Flow Problem
Lecture 20: Assignment 3 Discussion
Lecture 21: Least-Cost Path Problem
Lecture 22: Travelling Salesman Problem
Lecture 23: Vehicle Routing Problem
Lecture 24: Location Routing Problem
Lecture 25: Assignment 4 Discussion
Lecture 26: Quiz-II Discussion
Lecture 27: Non-Linear Programming
Lecture 28: Metaheuristics
Lecture 29: Hill Climb
Lecture 30: Threshold Accepting
Lecture 31: Simulated Annealing
Lecture 32: Tabu Search
Lecture 33: Iterative Local Search
Lecture 34: Variable Neighbourhood Search
Lecture 35: Evolutionary Computation
Lecture 36: Swarm Intelligence
Lecture 37: Case Study
Lecture 38: Case Study

Repository
Open issue

Search

Ctrl+K

By TeachBooks Team from Delft University of Technology, built with TeachBooks and Jupyter Book, CC BY 4.0

Last updated on April 4, 2025.