{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

503_HW8_S11 - Variables and their meanings and bounds...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Algorithms 91.503 (section 201) Spring, 2011 Page 1 of 2 Homework #8 Assigned: Tuesday, 4/19 Due: Tuesday, 4/26 at 5:30 p.m. This assignment covers textbook material in Chapter 29 (Linear Programming). 1. (100 points) Consider the following problem : A textbook publisher is planning to bind the latest version of our textbook in 3 different bindings: 1) paperback, 2) book club, and 3) library. Each book goes through a sewing and gluing process. The time required for each process is given in the accompanying table: Paperback Book Club Library Sewing (minutes) 2 2 3 Gluing (minutes) 4 6 10 Now, suppose that the sewing process is available 7 hours per day and the gluing process is available for 10 hours per day. Also, assume that the profits are $0.50 on a paperback edition, $0.80 on a book club edition, and $1.20 on a library edition. How many books will be manufactured in each binding when the profit is maximized? a) (30 points) Formulate this problem as a linear program by filling in the parts below:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon