Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271)

From MaRDI portal





scientific article; zbMATH DE number 3920194
Language Label Description Also known as
default for all languages
No label defined
    English
    Valid inequalities and separation for uncapacitated fixed charge networks
    scientific article; zbMATH DE number 3920194

      Statements

      Valid inequalities and separation for uncapacitated fixed charge networks (English)
      0 references
      0 references
      0 references
      1985
      0 references
      A family of valid linear inequalities for uncapacitated fixed charge networks is given. As special cases this family includes the linear inequalities describing the convex hull of the single-item uncapacitated lot-sizing problem and the variable upper bounds which are typically used in location and distribution planning problems. Various special cases, where the separation problem for the family of inequalities is solvable in polynomial time, are investigated.
      0 references
      cutting planes
      0 references
      valid linear inequalities
      0 references
      uncapacitated fixed charge networks
      0 references
      single-item uncapacitated lot-sizing problem
      0 references
      variable upper bounds
      0 references
      location and distribution planning
      0 references
      polynomial time
      0 references

      Identifiers

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