Linear programming applications This week we will showcase a few extra surprising applications of linear programming: How to play zero-sum games, and how to ex-…
Introduction to Discrete Optimization This week we introduce the notion of optimization problems, draw a distinction between continuous and discrete optimization, in- troduce linear programming,…
Week 2 Simplex Today we will introduce the simplex algorithm for solving a linear programs in standard form1. The main idea behind the algorithm is…
Maximum submodular coverage This week we study the maximum submodular coverage problem, a generalization of the maximum coverage problem. We also intro- duce the concept…
Assessed Preparation 1: 2: 3: 4: 5: 6: 7: 8: 9: functionCOUNT(A[1..n],target) count = 0 whilei ≤n do if A[i] = target then count =…
Week 9 Studio Sheet (Solutions) Useful advice: The following solutions pertain to the theoretical problems given in the tutorial classes. You are strongly advised to…
Assessed Preparation Week 6 Studio Sheet (Solutions) Useful advice: The following solutions pertain to the theoretical problems given in the tutorial classes. You are strongly…
Week 4 Studio Sheet (Solutions) Useful advice: The following solutions pertain to the theoretical problems given in the tutorial classes. You are strongly advised to…
Implementation checklist Week 10 Studio Sheet (Solutions) Useful advice: The following solutions pertain to the theoretical problems given in the tutorial classes. You are strongly…
Assessed Preparation Week 11 Studio Sheet (Solutions) Useful advice: The following solutions pertain to the theoretical problems given in the tutorial classes. You are strongly…