Binding Inequalities for Tree Network Location Problems with Distance Constraints.

Abstract

This paper considers the problem of finding locations of several new facilities in an imbedded tree network with respect to existing facilities at known locations so as to satisfy distance constraints, which impose upper bounds on distances between pairs of facilities. It is known that the existence of a feasible solution to the distance constraints is related to shortest paths through an auxiliary network, which has as arc lengths the upper bounds on pairwise facilities distances. This relationship takes the form of necessary and sufficient conditions, termed the separation conditions. Tight separation conditions are related to the solution of multifacility minimax location problems and efficient solutions to multiobjective multifacility location problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1978
Accession Number
ADA060347

Entities

People

  • Barbaros C. Tansel
  • Richard L. Francis
  • Timothy J. Lowe

Organizations

  • University of Florida

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Consistency
  • Contracts
  • Engineering
  • Industrial Engineering
  • Inequalities
  • Military Research
  • Multiobjective Optimization
  • Notation
  • Operations Research
  • Pipelines
  • Systems Engineering
  • Travel Time
  • Triangles

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)