Interactive Multidimensional Programming; Models for Locational Decision
February 1981
Article
pp 220-223.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(eur_spronk_I13.pdf, 0.5MB) |
|
Redirect to publisher's version
(publisher's version.url.txt, 50 bytes) |
The paper is devoted to an extension of traditional location theory in two directions. First, the usual assumption of a single cost function will be abandoned by introducing multiple objectives. This gives rise to a multidimensional programming framework for the traditional location models. The paper provides a solution algorithm for the latter problem. Next, the assumption of a uniform space will be tackled by taking account of discrete candidate-locations. This problem can be solved by means of an adjusted multiciteria analysis. The solution algorithms for both extensions are based on an interactive strategy, so that the decision-maker may identify the most favourable location in a finite number of steps.
Keywords
Automatically Extracted Terms
- solution
- programming
- model
- objective
- problem
- decision
- function
- weber
- nijkamp
- compromise
- point
- procedure
- location
- analysis
- objective functions
- decision-maker
- compromise solution
- algorithm
- ni /kamp j
- multiobjective
