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: 15 Multicommodity transportation Linear programs in practice are often very large. Typically these massive models arise from interfacing smaller models. In this section we describe a typical example. For more, look at Chapter 4 in the AMPL book [1]. In Section 11 we introduced a model called the “transportation prob lem”. The model involves transporting a certain commodity from m origins, with supplies s 1 , s 2 , . . . , s m units of the commodity, to n destinations, with demands d 1 , d 2 , . . . , d n units. We assume total supply equals total demand: m X i =1 s i = n X j =1 d j . To transport one unit of the commodity along the link from origin i to desti nation j costs c ij , so if we choose to transport x ij units on this link, it costs us c ij x ij . Our problem is to choose nonnegative values for the variables x ij (each of which may also be subject to an upper limit l ij ) in order to minimize the total transportation cost. Mathematically, we can write this problem as follows: minimize m X i =1 n X j =1 c ij x ij subject to n X j =1 x ij = s i ( i = 1 , 2 , . . . , m ) m X i =1 x ij = d j ( j = 1 , 2 , . . . , n ) ≤ x ij ≤ l ij ( i = 1 , 2 , . . . , m, j = 1 , 2 , . . . , n ) ....
View
Full
Document
This note was uploaded on 02/20/2009 for the course ORIE 3300 taught by Professor Todd during the Fall '08 term at Cornell.
 Fall '08
 TODD

Click to edit the document details