The Mixing Set with Divisible Capacities
نویسندگان
چکیده
Given rational numbers C0, . . . , Cm and b0, . . . , bm, the mixing set with arbitrary capacities is the mixed-integer set defined by conditions s + Ctzt ≥ bt, 0 ≤ t ≤ m, s ≥ 0, zt integer, 0 ≤ t ≤ m. Such a set has applications in lot-sizing problems. We study the special case of divisible capacities, i.e. Ct/Ct−1 is a positive integer for 1 ≤ t ≤ m. Under this assumption, we give an extended formulation for the convex hull of the above set that uses a quadratic number of variables and constraints.
منابع مشابه
The mixing set with divisible capacities: A simple approach
We give a simple algorithm for linear optimization over the mixing set with divisible capacities, and derive a compact extended formulation from such an algorithm. The main idea is to apply a suitable unimodular transformation to obtain an equivalent problem that is easier to analyze.
متن کاملCore Discussion Paper 2005/62 Compact Formulations as a Union of Polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhedral description of the convex hull of each subset, and then take the convex hull of the union of these polyhedra. The resulting extended formulation is then compact, its projection is the convex hull of the original s...
متن کاملCompact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhedral description of the convex hull of each subset, and then take the convex hull of the union of these polyhedra. The resulting extended formulation is then compact, its projection is the convex hull of the original s...
متن کاملThe mixing-MIR set with divisible capacities
We study the set S = {(x, y) ∈ + × Zn : x + Bjyj ≥ bj, j = 1, . . . , n}, where Bj , bj ∈ +−{0}, j = 1, . . . , n, and B1| · · · |Bn. The set S generalizes the mixed-integer rounding (MIR) set of Nemhauser and Wolsey and the mixing-MIR set of Günlük and Pochet. In addition, it arises as a substructure in general mixed-integer programming (MIP), such as in lot-sizing. Despite its importance, a n...
متن کاملMixing MIR inequalities with two divisible coefficients
This paper is a polyhedral study of a generalization of the mixing set where two different, divisible coefficients are allowed for the integral variables. Our results generalize earlier work on mixed integer rounding, mixing, and extensions. They also directly apply to applications such as production planning problems involving lower bounds or start-ups on production, when these are modeled as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008