Reformulation by discretization: Application to economic lot sizing

Authors:
Miguel Constantino;Luis Gouveia
Affiliations:
Faculdade de Ciências da Universidade de Lisboa, DEIO-CIO Bloco C/6 Piso 4-Campo Grande, Cidade Universitária, 1749-016 Lisboa, Portugal;Faculdade de Ciências da Universidade de Lisboa, DEIO-CIO Bloco C/6 Piso 4-Campo Grande, Cidade Universitária, 1749-016 Lisboa, Portugal
Venue:
Operations Research Letters
Year:
2007

Citing 6
Cited 1

Generating alternative mixed-integer programming models using variable redefinition

Operations Research
Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Improved algorithms for economic lot size problems

Operations Research
On the capacitated concentrator location problem: a reformulation by discretization

Computers and Operations Research

Extended formulations for the cardinality constrained subtree of a tree problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we apply a discretization reformulation technique to the classical economic lot sizing problem. This reformulation yields the same LP bounds as the original model. We show, however, that by reducing adequately the coefficients of some variables, one obtains an enhanced reformulation whose LP relaxation solution is integer.