Consider a school district with I neighborhoods, J schools, and G grades at each school. Each school j has a capacity of C jg for grade g. In each neighborhood i , the student population of grade g is S ig. Finally, the distance of school j from neighborhood i is dij. Formulate a linear programming problem whose objective is to assign all students to schools, while minimizing the total distance traveled by all students. (You may ignore the fact that numbers of students must be integer).

Question
Asked Sep 10, 2019
53 views
Consider a school district with I neighborhoods, J schools, and G grades at each school. Each school j has a capacity of C jg for grade g. In each neighborhood i , the student population of grade g is S ig. Finally, the distance of school j from neighborhood i is dij
. Formulate a linear programming problem whose objective is to assign all students to schools, while minimizing the total distance traveled by all students. (You may ignore the fact that numbers of students must be integer).
check_circle

Expert Answer

Step 1

Let the decision variables be xijg = 'm' students from neighborhood i assigned to...

Want to see the full answer?

See Solution

Check out a sample Q&A here.

Want to see this answer and more?

Solutions are written by subject experts who are available 24/7. Questions are typically answered within 1 hour.*

See Solution
*Response times may vary by subject and question.
Tagged in

Business

Operations Management

Related Operations Management Q&A

Find answers to questions asked by student like you
Show more Q&A
add