BU275 Lecture Notes - Lecture 9: Digic, Set Cover Problem, Linear Programming
Document Summary
Midterm heavy covering on formulations: objective function, decision variables, constraints. A regional municipality is building paramedic stations to provide ambulance coverage in the townships: we want to provide coverage such that an ambulance is at most 14 minutes away, cells depict minutes. 0: set covering: trying to cover all of the sites with "bubbles" of necessity, the objective is to minimize the number of stations built, decision variables. Let xi=1 if we open a station at site i=1,2,3,4,5. Coverage constraints (a) x1+x2 (cid:3410)1 (b) x1+x2+x3 (cid:3410)1 (c) x2+x3+x4 (cid:3410)1 (d) x3+x4 (cid:3410)1 (e) x5(cid:3410)1 order to cover a) At least one of site land 2 must be chosen (in. Fixed charge (mixed integer programs: transportation with fixed charge. 18: the objective is to ship all the grain while minimizing total costs (transport & fixed, if we send anything to a mill we must incur its entire fixed cost, decision variables:
