Back to search

McMaster University

Interactive computer graphical approaches to some maximin and minimax location problems

Abstract

dc:description.abstract

<p>This study describes algorithms for the solution of several single facility location problems with maximin or minimax objective functions. Interactive computer graphical algorithms are presented for maximizing the minimum rectilinear travel distance and for minimizing the maximum rectilinear travel distance to a number of point demands when there exist several right-angled polygonal barriers to travel. For the special case of unweighted rectilinear distances with barriers, a purely numerical algorithm for the maximin location problem is described. An interactive computer graphical algorithm for maximizing the minimum Euclidean, rectilinear, or general l$\sb{\rm p}$ distance to a number of polygonal areas is described. A modified version of this algorithm for location problems with the objective of minimizing the maximum cost when the costs are non-linear monotonically decreasing functions of distance is presented. Extension of this algorithm to problems involving the minimization of the maximum cost when the costs are functions of both distance and direction is discussed using asymmetric distances.</p>

Degree

thesis:*
Department dc:contributor.department
Management Science/Systems
Year dc:date.issued
1988

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Buchanan, John David
Advisor dc:contributor.advisor
  • Wesolowsky, G. O.

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/3441
4458
1622893

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Buchanan, John David. Interactive computer graphical approaches to some maximin and minimax location problems. 1988. http://hdl.handle.net/11375/8220