For each description in the left, match the most appropriate problem name. A. Fa
ID: 3146802 • Letter: F
Question
For each description in the left, match the most appropriate problem name.
A. Facility location problem B. Assignment problem C. Transportation problem D. Set covering problem E. Shortest path problem
1. The problem of locating warehouses to minimize the total distance that must be traveled to provide required services.
2. Given two finite sets (called Set 1 and Set 2), the problem of minimizing the required number of elements in Set 2 to serve all the elements in Set 1.
3. Given two finite sets (called Set 1 and Set 2), the problem of minimizing the cost of assigning, on a one-to-one basis, elements of Set 1 to elements of Set 2.
4. The problem of minimizing the cost of shipping products from locations (with specified product amounts) to customer locations for satisfying customer demands.
Explanation / Answer
A -- 4 The problem of minimizing the cost of shipping products from locations (with specified product amounts) to customer locations for satisfying customer demands.
B --2
C--3
E--1
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.