BU275 Lecture Notes - Lecture 1: Microbrewery, Feasible Region
Document Summary
Prof: dr. david wheatley, lh 4073, dwheatley@wlu. ca, hours: t/th, 12-2. Ta: sara babaee, hours: mf 11-12:50, lh 2045, by appointment: Due printed and online by 11 am on the due date: midterm. One single-sided sheet of notes is allowed. May be handwritten or typed: final. Chapters 9, 11, 12, 13 (sections 1,2, 4-7), 17. Intro to linear programming: a craft brewery. A small keg of lager (20l) takes. We only have 50 kg of barley and 0. 84 kg of hops. In other words how many kegs of each beer should we make. Decision variable: one variable per decision to make. Let x1 represent the number of kegs of lager to make. Let x2 represent the number of kegs of ale to make. Then any choice of (x1,x2) is a "solution" to our problem. We can compute the amount of barley required. Requirement 2: typical linear programs (lps) have.
