Computing minimal forecast horizons: An integer programming approach

Computing minimal forecast horizons: An integer programming approach

0.00 Avg rating0 Votes
Article ID: iaor2007562
Country: Netherlands
Volume: 5
Issue: 2
Start Page Number: 239
End Page Number: 258
Publication Date: Jun 2006
Journal: Journal of Mathematical Modelling and Algorithms
Authors: , , ,
Keywords: programming: integer, forecasting: applications
Abstract:

In this paper, we use integer programming (IP) to compute minimal forecast horizons for the classical dynamic lot-sizing problem. As a solution approach for computing forecast horizons, integer programming has been largely ignored by the research community. It is our belief that the modelling and structural advantages of the IP approach coupled with the recent significant developments in computational integer programming make for a strong case for its use in practice. We formulate some well-known sufficient conditions, and necessary and sufficient conditions (characterizations) for forecast horizons as feasibility/optimality questions in 0–1 mixed integer programs. An extensive computational study establishes the effectiveness of the proposed approach.

Reviews

Required fields are marked *. Your email address will not be published.