This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CO 227: Lecture Note Examples - Jan 9 The integer program we saw in class today was a bit more complicated than what we have seen before. The setting was that your company manufactures construction machinery. You have l factories that we will call F 1 ,...,F l . For each 1 ≤ i ≤ l , we have that factory F i produces exactly one type of product. To manufacture one copy of this product, factory F i must use r i tons of steel and pay c i in labour costs. Each requirement r i is an integer. Your company sells each item for precisely $50,000 dollars, no matter which product it is. You get your steel from suppliers that we will denote by S 1 ,...,S n . For each 1 ≤ j ≤ n , supplier S j charges p j dollars per ton of steel and only has m j tons of steel available. Finally, there are significant transportation costs to ship a ton of steel from a supplier to the factories. To be precise, for each factor F i and each supplier S j it costs d i,j dollars to ship one ton of steel from S j to...
View Full Document
- Fall '08
- Optimization, factory Fi