Relaxations for two-level multi-item lot-sizing problems

Date

2014-08

Authors

Vyve, M. V.
Wolsey, L. A.
Yaman, H.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Mathematical Programming

Print ISSN

0025-5610

Electronic ISSN

1436-4646

Publisher

Springer

Volume

146

Issue

1-2

Pages

495 - 523

Language

English

Journal Title

Journal ISSN

Volume Title

Series

Abstract

We consider several variants of the two-level lot-sizing problem with one item at the upper level facing dependent demand, and multiple items or clients at the lower level, facing independent demands. We first show that under a natural cost assumption, it is sufficient to optimize over a stock-dominant relaxation. We further study the polyhedral structure of a strong relaxation of this problem involving only initial inventory variables and setup variables. We consider several variants: uncapacitated at both levels with or without start-up costs, uncapacitated at the upper level and constant capacity at the lower level, constant capacity at both levels. We finally demonstrate how the strong formulations described improve our ability to solve instances with up to several dozens of periods and a few hundred products.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)