ENGRI 1101 Engineering Applications of OR Fall 2008 Homework 6 The Transportation Problem • Due date: 4:00pm on Friday, October 10, 2008 in the ENGRI 1101 box at the west end of the corridor on the second ±oor of Rhodes Hall, where it connects to Upson. • Reading assignment: Pages 1-4 in Handout 7 on the transportation problem. • Make sure to put your name on the ²rst page and staple the problems in order. 1. (55 points) Consider the following problem: there are m warehouses, where warehouse i has supply s i , for each i = 1 , . . . , m ; there are n stores, where store j has demand d j , for each j = 1 , . . . , n ; there is a per-unit shipping charge from warehouse i to store j of c ij dollars, for each i = 1 , . . . , m , j = 1 , . . . , n . (That is, so far, the input is of the form required for the transportation problem.) Unlike in the transportation problem, we are no longer required to meet the demand of each store. (However, we must still restrict the shipments out of warehouse
This is the end of the preview. Sign up
access the rest of the document.
This note was uploaded on 12/25/2009 for the course ENGRI 1101 at Cornell.