EFFICIENT SOLUTIONS IN MULTIOBJECTIVE TREE NETWORK LOCATION PROBLEMS

The problem of locating a single facility on a tree network where there is more than one objective function to be minimized is considered. A constructive method is given for finding the efficient set of solutions when the objective functions are convex and the constraints define a convex set. Partial results are given for the case where the feasible region is not a convex set.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  USA  21202
  • Authors:
    • Lowe, T J
  • Publication Date: 1978-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00196473
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Aug 15 1979 12:00AM