Yaman, H.2015-07-282015-07-282009-07-280166-218Xhttp://hdl.handle.net/11693/11812We consider a production planning problem for two items where the high quality item can substitute the demand for the low quality item. Given the number of periods, the demands, the production, inventory holding, setup and substitution costs, the problem is to find a minimum cost production and substitution plan. This problem generalizes the well-known uncapacitated lot-sizing problem.Westudy the projection of the feasible set onto the space of production and setup variables and derive a family of facet defining inequalities for the associated convex hull. We prove that these inequalities together with the trivial facet defining inequalities describe the convex hull of the projection if the number of periods is two. We present the results of a computational study and discuss the quality of the bounds given by the linear programming relaxation of the model strengthened with these facet defining inequalities for larger number of periods.EnglishLot-sizingProduct SubstitutionPolyhedral AnalysisFacet Defining InequalitiesConvex HullArticle10.1016/j.dam.2009.06.0101872-6771