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

View Full Document Right Arrow Icon
M ASSACHUSETTS I NSTITUTE OF T ECHNOLOGY 15.053 – Optimization Methods in Management Science (Spring 2007) Problem Set 8 Due April 19 th , 2007 at 4:30 pm. You will need 120 points out of 140 to receive a grade of 5. All Problems are Worth 20 Points Problem 1: Caterer problem. As part of its food service, a caterer needs dj napkins for each day of the upcoming week. He can buy new napkins at the price of α cents each or have his soiled napkins laundered. Two types of laundry service are available: regular and expedited. The regular laundry service requires two working days and costs β cents per napkin, and the expedited service requires one working day and costs y cents per napkin (y > β ). The problem is to determine a purchasing and laundry policy that meets the demand at the minimum possible cost. Formulate this problem as a minimum costs flow problem. (Hint: Define a network on 15 nodes, 7 nodes corresponding to soiled napkins, 7 nodes corresponding to fresh napkins, and 1 node for the supply of fresh napkins.) Problem 2: Passenger routing United Airlines has six daily flights from Chicago to Washington. From 10 A.M. until 8 P.M., the flights depart every 2 hours. The first three flights have a capacity of 100 passengers and the last three flights can accommodate 150 passengers each. If
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/17/2012 for the course MGMT 15.053 taught by Professor Jamesorli during the Spring '07 term at MIT.

Page1 / 6


This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online