Lot-sizing with stock upper bounds and fixed charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtained as the intersection of two simpler sets, one involving just 0-1 variables and the second a mixing set with a variable upper bound constraint. For these two sets we derive both inequality descriptions and polynomial-size extended formulations of their respective convex hulls. Finally we carry out some limited computational tests on single-item constant capacity lot-sizing problems with upper bounds and fixed charges on the stock variables in which we use the extended formulations derived above to strengthen the initial mixed integer programming formulations.
|Date of creation:||01 Apr 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)|
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2009025. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS)
If references are entirely missing, you can add them using this form.