Recently there has been considerable research on simple mixed-integer sets, called mixing sets, and closely related sets arising in uncapacitated and constant capacity lot- sizing. This in turn has led to study of more general sets, called network-dual sets, for which it is possible to derive...

For the problem of lot-sizing on a tree with constant capacities, or stochastic log-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q, SQ) inequalities can be simplified and extended....