DII CGO
inicioir al DIIbuscar
fcfm
top
topleft
a polyhedral approach to lot-sizing problems: 30 years on
We present a personal view of how the subject has evolved over the last 30 years, leading to:

i) a variety of results about elementary mixed integer programs, such as mixing sets and network dual mixed integer programs,

ii) extended formulations (and cutting plane algorithms) for a wide range of single-item lotsizing variants that have been very effective computationally,

iii) further applications to multi-item lot-sizing, the discrete newsvendor problem, inventory routing (shipping) and chance-constrained programming, and

iv) challenging questions concerning the use of large extended formulations.

 

Bío: Laurence Wolsey es profesor en el Center for Operations Research and Econometrics, CORE de la Université Catholique de Louvain, Bélgica. Su principal campo de investigación es la programación entera mixta, en la que ha hecho aportes fundamentales tanto en la teoría como en la práctica computacional. Es co-autor de reconocidos libros de enseñanza como Integer Programming and Combinatorial Optimization y 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. Fue editor de Mathematical Programming y ha colaborado en empresas como BASF, France Telecom y DASH. Entre los premios que ha recibido destacan el Orchard-Hays, en 1988 de la Mathematical Programming Society (con TJ Van Roy); el Lanchester Prize, en 1989 de la Operations Research Society of America (con G.L. Nemhauser), y la EURO Gold Medal en 1994.