Discrete location models

8 important questions on Discrete location models

What kind of problem is the set vocering problem?

A NP-hard problem, that in practice can be solved with relaxation and has often an all integer solution

What are the weaknesses of the location set covering problem?

  • It is expensive to locate the number of facilities needed to cover all demands.
  • There are often a large number of optimal alternative solutions
  • The model makes no distinguishment between small or large nodes

What does the maximal covering model do?

To locate p facilities to maximize the number of covered demands
  • Higher grades + faster learning
  • Never study anything twice
  • 100% sure, 100% understanding
Discover Study Smart

Does the maximal covering model distinguish small and large nodes?

Yes! The model distinguish small and large nodes and allows some nodes to be uncovered

In general, how many facilities are needed to cover 80 to 90 percent of the demand?

Only half the number of sites to cover all demands

How do covering models generally treat distances?

As binary, either a node is covered or it is not

What is the problem with the p-median problem?

That they ignores differences in the facility location costs at different sites

What is the trade off between average and maximum distance objective?

The optimal solution for one objective is likely to do poorly on the other objective, luckly there are good compromizes

The question on the page originate from the summary of the following study material:

  • A unique study and practice tool
  • Never study anything twice again
  • Get the grades you hope for
  • 100% sure, 100% understanding
Remember faster, study better. Scientifically proven.
Trustpilot Logo