Background material This unit of study assumes some basic knowledge of discrete math- ematics, algorithm analysis, and linear algebra. This is all basic material that…
comp3530 Assignment 5 s2 2016 This assignment is due on Nov 12. All submitted work must be done individually without consulting someone else’s solutions in…
Integral Polyhedra We have seen some examples1 of linear programming formulation that are integral, meaning that every basic feasible solution is an in- tegral vector.…
Linear program modeling This week we will showcase a few examples of optimization prob- lems that can be modeled as linear programs: how to approximate…
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…