Much progress has been made in recent years in solving certain classes of production planning problems using mixed integer programming. One of the major challenges is how to make this expertise available and easy to use to the non-specialist and to the practitioners. Here we describe a modeling...

We examine the polyhedral structure of the convex hull of feasible solutions of the capacitated facility location problem. In particular we derive necessary and sufficient conditions for a family of "effective capacity" inequalities to be facet-defining, and further results on a more general...

We examine the single-item lot-sizing problem with Wagner-Whitin costs over an n period horizon, i.e. Pt + ht ≥ Pt+l for t = 1, ... , n - 1, where Pt, ht are the unit production and storage costs in period t respectively, so it always pays to produce as late as possible. We describe integral...

We consider the single item lot-sizing problem with capacities that are non-decreasing overtime. When the cost function is i) non-speculative or Wagner-Whitin (for instance, constantunit production costs and non-negative unit holding costs), and ii) the production set-upcosts are non-increasing...

We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, constant unit production costs and non-negative unit holding costs), and ii) the production set-up costs are...

Much progress has been made in recent years in solving certain classes of production planning problems using mixed integer programming. One of the major challenges is how to make this expertise available and easy to use to the non-specialist and to the practitioners. Here we describe a modeling...

Three regions arising as surrogates in certain network design problems are the knapsack set X = {x [ belong ] [Z^n_+] : [ sum^n_j=1] C_jx_j ≥ b}, the simple capacitated flow set Y = {(y, x) [belong ] [R^1_+] x [Z^n_+] : y ≤ b,y ≤ [ sum^n_j=1] C_jx_j} and the set Z = {(y, x) [ belong ]...