A missing person search requires assigning multiple resources teams (trackers, dogs, ground searchers, deputies) to multiple...

 

Transcribed Image Text:

A missing person search requires assigning multiple resources teams (trackers, dogs, ground searchers, deputies) to multiple search locations (Forest, Field, Neighborhood, Roads). The neighborhood includes the location where the subject was last seen, and hence is a likely place to find scent or tracks. It must be covered by either the trackers or the dogs. The hours required for the different resource teams to adequately search the different search locations are given in the table below. Each team can only search one location, and each location must be searched. Assignments are to be made to keep the total search hours as low as possible to facilitate reassignment to other areas. Let Xij represent the assignment of resource team i to search location j. Search Location Time to search Resource team 1. Trackers 2. Dogs 3. Ground searchers 4. Deputies The constraint for the dogs assignment is: 5. Forest 5 5 4 6 6. Field 7. Neighborhood 8. Roads 4 3 3 5 2 2 Can't do Can't do 6 5 5 A missing person search requires assigning multiple resources teams (trackers, dogs, ground searchers, deputies) to multiple search locations (Forest, Field, Neighborhood, Roads). The neighborhood includes the location where the subject was last seen, and hence is a likely place to find scent or tracks. It must be covered by either the trackers or the dogs. The hours required for the different resource teams to adequately search the different search locations are given in the table below. Each team can only search one location, and each location must be searched. Assignments are to be made to keep the total search hours as low as possible to facilitate reassignment to other areas. Let Xij represent the assignment of resource team i to search location j. Search Location Time to search Resource team 1. Trackers 2. Dogs 3. Ground searchers 4. Deputies The constraint for the dogs assignment is: 5. Forest 5 5 4 6 6. Field 7. Neighborhood 8. Roads 4 3 3 5 2 2 Can't do Can't do 6 5 5

Answer rating: 100% (QA)

Answer The constraint for the dogs assignment is X2j X3j X2j X3j 5 for all j This constraint ensures that the number of dogs assigned to search location j is at least the difference between the total ... View the full answer