This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 9 Due April 14, 2009 Exercise 3, page 352 Suppose you have 7 full water bottles, 7 halffull, and 7 empty. You would like to divide the 21 bottles among three individuals so that each receives 7 bottles with the same quantity of water. Expressed the problem as integer programming and find an optimal solution. Exercise 7, page 352 You have the following threeletter words: AFT, FAR, TVA, ADV, JOE, FIN, OSF, and KEN. Each letter in the alphabet is assigned a value, staring with A=1 to Z=26. Each word is scored by summing the numeric values of its letters. For example, AFT has score of 1+6+20=27. You are to select five of the given eight words that yield the maximum total score. The selected five words should satisfy the following constraints: sum of letter 1 scores < sum of letter 2 scores < sum of letter 3 scores . Formulate the problem as integer programming (IP). Exercise 10, page 353 The RecordaSong Company has contracted with a rising star to record eight songs....
View
Full
Document
This note was uploaded on 08/31/2010 for the course IESE GE 330 taught by Professor Nedich during the Spring '09 term at University of Illinois at Urbana–Champaign.
 Spring '09
 Nedich

Click to edit the document details