Unformatted text preview: x ijg = # students from neighborhood i assigned to school j in grade g, for i ∈ I,j ∈ J,g ∈ G. The LP is given below: min ∑ i ∈ I ∑ j ∈ J d ij ∑ g ∈ G x ijg ! (total distance traveled) s.t. ∑ i ∈ I x ijg ≤ C jg , ∀ j ∈ J,g ∈ G (max capacity of a school for a grade) ∑ j ∈ J x ijg = S ig ∀ i ∈ I,g ∈ G (assign all students) all x ijg ≥ (nonnegativity) One could also solve a separate problem for each grade g ∈ G , as the description of the problem essentially separates the problem for each grade into an individual assignment task. Of course, the above single LP will solve the entire problem in one step....
View
Full
Document
This note was uploaded on 02/15/2011 for the course EECS 6.231 taught by Professor Bertsekas during the Spring '10 term at MIT.
 Spring '10
 Bertsekas
 Optimization

Click to edit the document details