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: Because there is a finite number, we may be able to loop through everything, but complicated and takes a long time Method 2: Decision Variables: X j = 1 locate a facility at j 0 o.w. Y ij = 1 assign node i to j 0 o.w. weight OBJECTIVE FUNCTION Subject to make sure you dont assign consumers to stores that are unoperated every customer is served NP-hard nondeterministic O ( n ) N 1 (size of model) 10 x N 1 1000N 1 O ( n 2 ) N 2 3.16 x N 2 31.6N 2 O ( e n ) N 3 N 3 + 2.30 N 3 + 6.91 speed = 1 speed = 10 speed=1000...
View Full Document
This document was uploaded on 02/01/2012.
- Spring '09