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: Similarly for A2, A3, B2, and B3. Max. profit= A1(77  58) + A2(47 14.5) + A3(47 29) + B2(39) + B3(49) Subject to: A1 + A2 + A3 <=20 (number trucks available) A1(2) + A2(.5) + A3(1) <=120 (number hours available for trucks) B2 + B3 <=500 (number of calls per month that MM can take) B2 >= B3(2) A1(3) <=A2 + A3 all variables >=0 (nonnegativity) 3. Decision variables: Let x1 be a binary variable where we open a cart a Nassau St. (x1=1, or we dont (x1=0). Similarly for x2, x3, x4, and x5. Min. cost=x1(1500) + x2(2200) + x3(2900) + x4(1600) + x5(1200). Subject to: x2 + x3 >=1 (site A distance) x2 + x4 >=1 (site B distance) x1 + x5 >=1 (site C distance) x4 =1 (site D distance) all variables binary...
View Full
Document
 Fall '06
 RUBIN,David

Click to edit the document details