Methods for a class of discrete location problems (Q3706797)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3934725
Language Label Description Also known as
default for all languages
No label defined
    English
    Methods for a class of discrete location problems
    scientific article; zbMATH DE number 3934725

      Statements

      Methods for a class of discrete location problems (English)
      0 references
      0 references
      0 references
      1985
      0 references
      integer linear programming
      0 references
      implicit enumeration method
      0 references
      approximate methods
      0 references
      \(\epsilon \) -optimal solutions
      0 references
      uncapacitated plant location
      0 references
      two-state location problems
      0 references
      Consider a finite set J and functions g, h from the set of all subsets of J to the set of real numbers, where g is monotone decreasing (A\(\subseteq B\) implies g(B)\(\leq g(A))\) and h is additive \((h(A\cup B)=h(A)+h(B)\) for \(A\cap B=\emptyset)\) as well as monotone increasing (A\(\subseteq B\) implies h(A)\(\leq h(B))\). Furthermore let \(J^+\), \(J^-\subseteq J\) be disjoint sets. Then the following discrete optimization problem P is discussed. Minimize \(f(L)=g(L)+h(L)\) subject to \(J^+\subseteq L\) and \(L\cap J^-=\emptyset\). For a non-negative real number \(\epsilon\) a feasible solution L(\(\epsilon)\) of P is called \(\epsilon\)-optimal if f(L(\(\epsilon)\))\(\leq f(L)+\epsilon\) for all feasible L. An implicit enumeration method and approximate methods for finding \(\epsilon\)-optimal solutions are discussed. It turns out that uncapacitated plant location problems and two-state location problems among others are special cases of P.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references