Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732): Difference between revisions

This article considers the capacitated lot-sizing problem in combinatorial optimization. The author begins with an introduction to lot-sizing problems and their variants, including an overview of the literature. The second section contains the necessary background and an overview of known valid inequalities. The third section examines valid inequalities specific to the studied problem and examines the conditions under which these are facet defining. In particular, the author combines two types of known valid inequalities to produce a new class of inequalities which are facet defining under some conditions. Several properties of these valid inequalities are presented and proven.