Location Analysis Final Exam

The flashcards below were created by user dtarasov on FreezingBlue Flashcards.

  1. With locational interdependence modeling, decisions are made based on the location of _________.
    A. demand
    B. materials
    C. competitors
    D. all of the above
    D. all of the above
  2. Locational interdependence modeling was first developed by __________ in 1929.

    A. Hotelling
    B. Loesch
    C. Isard
    D. Palander
    A. Hotelling
    (this multiple choice question has been scrambled)
  3. In what type of problem does a new entrant decide where to locate based on the location of existing competitors?
    The maximum capture (MAXCAP) model.
  4. True or false: The MAXCAP model assumes that, if a new facility is nearer to a demand site than a competitor's facility, the new facility will capture all of that site's demand.

    A. True
    B. False
    A. True
  5. True or false: under the MAXCAP model, if a new entrant's facility and a competitor's facility are equidistant with regard to a demand site, the new facility captures 1/2 of the site's demand.

    A. True
    B. False
    A. True
  6. Choosing locations so as to minimize market share that future competitors can capture is the domain of ______________.
    A. the preemptive location problem
    B. the maximum-capture model
    C. game theory
    D. locational interdependence modeling
    A. the preemptive location problem
    (this multiple choice question has been scrambled)
  7. True or false: game theory is used for making decisions in the absence of complete certainty.

    A. True
    B. False
    A. True
  8. Upper and lower bounds on the value of a 2-person, zero-sum game can be found by the minimum of every row and the maximum of every column. Then the lower bound is the ____________ and the upper bound is the ______________.

    A. maximum of the maxima; minimum of the minima
    B. minimum of the minima; maximum of the maxima
    C. minimum of the maxima; maximum of the minima
    D. maximum of the minima; minimum of the maxima
    C. minimum of the maxima; maximum of the minima
    (this multiple choice question has been scrambled)
  9. A. True or false: in game theory, if the upper and lower bounds are equal, then the value of the game has been found.

    A. True
    B. False
    A. True
  10. In game theory, if the lower and upper bounds are equal, both players are using a ________ strategy.

    A. mixed
    B. pure
    C. either mixed or pure
    B. pure
    (this multiple choice question has been scrambled)
  11. In game theory, if the lower and upper bounds are not equal, the two players pursue ___________.

    A. a pure strategy
    B. a mixed strategy
    C. either a mixed or a pure strategy
    B. a mixed strategy
    (this multiple choice question has been scrambled)
  12. The Nash equilibrium point, at which no single deviation by any player is profitable, exists in a cell in which the _____ number is the maximum of the cell's _____ and the _____ number is the maximum of the cell's _____. 

    A. first; row; second; column;
    B. second; row; first; column
    C. first; column; second; row
    D. second; column; first; row
    C. first; column; second; row
    (this multiple choice question has been scrambled)
  13. The optimal solution to a multi-objective problem is one that is ________.

    A. at equilibrium
    B. inferior
    C. non-inferior
    D. unbounded
    C. non-inferior
    (this multiple choice question has been scrambled)
  14. True or false: in a non-inferior solution, one can improve the value of one objective function without degrading the value of at least one other. 

    A. True
    B. False
    B. False
  15. True or false: Pareto optimality in welfare economics is another name for a non-inferior solution.

    A. True
    B. False
    A. True
  16. Preference ranking, weighting each objective, goal programming, and enumerating non-inferior solutions are all approaches to solving

    A. multi-objective problems.
    B. P-median problems.
    C. maximum-covering problems.
    D. location set-covering problems.
    A. multi-objective problems.
    (this multiple choice question has been scrambled)
  17. With goal programming, what kind of variables are added for greater-or-equal relationships?

    A. Surplus
    B. Slack
    C. Neither
    D. Both
    B. Slack
    (this multiple choice question has been scrambled)
  18. With goal programming, what kind of variables are added for "equals" relationships?

    A. Slack
    B. Both 
    C. Surplus
    D. Neither
    B. Both
    (this multiple choice question has been scrambled)
  19. True or false: Goal programming is generally not criticized for tending to result in inferior solutions.

    A. True
    B. False
    B. False
  20. True or false: assigning weights to objective is a way of avoiding inferior solutions with goal programming.

    A. True
    B. False
    A. True
  21. The ________ problem is often used while siting noxious facilities.

    A. multi-objective
    B. maximal covering
    C. location set covering
    D. anti-covering
    D. anti-covering
    (this multiple choice question has been scrambled)
  22. With the anti-covering problem, the radius within which one must not locate is 

    A. Ai
    B. Aj
    C. Cj
    D. Cij
    B. Aj
    (this multiple choice question has been scrambled)
  23. What are the four elements to any decision-making problem?
    • 1. Data
    • 2. Procedures
    • 3. Goals and constraints
    • 4. Strategies
Author:
dtarasov
ID:
313286
Card Set:
Location Analysis Final Exam
Updated:
2015-12-17 00:35:56
Tags:
locational interdependence competition multi objective location modeling
Folders:
Location analysis
Description:
Terms and concepts for the final exam in the Location Analysis course.
Show Answers: