Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271): Difference between revisions
From MaRDI portal
Latest revision as of 18:08, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Valid inequalities and separation for uncapacitated fixed charge networks |
scientific article |
Statements
Valid inequalities and separation for uncapacitated fixed charge networks (English)
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
