Linear-Programming

A slight diversion: how to reformulate a linear program with a nested maximisation using duality

Introduction to robust optimisation under uncertainty. Part 1 covers theoretical foundations and the trade-offs between optimality and robustness.

Solving the knight’s tour problem using Mixed Integer Programming. Explore combinatorial optimization with constraint programming techniques.