Showing 1 - 10 of 1,883
We consider mixed-integer sets of the type M IX T U = {x : Ax b; xi integer, i I}, where A is a totally unimodular matrix, b is an arbitrary vector and I is a nonempty subset of the column indices of A. We show that the problem of checking nonemptiness of a set M IX T U is NP-complete when A...
Persistent link: https://www.econbiz.de/10008493853
We consider here the mixing set with flows: s + xt = bt, xt = yt for 1 = t = n; s [belongs] R+exp.1+, ˙ [belongs] R+exp.n, y [belongs] Z+exp.n. It models the "flow version" of the basic mixing set introduced and studied by Gunluk and Pochet, as well as the most simple stochastic lot-sizing...
Persistent link: https://www.econbiz.de/10005008668
Persistent link: https://www.econbiz.de/10003402479
We consider mixed-integer sets of the type MIX TU = {x : Ax amp;#8805; b; xi integer, i amp;#8712; I}, where A is a totally unimodular matrix, b is an arbitrary vector and I is a nonempty subset of the column indices of A. We show that the problem of checking nonemptiness of a set MIX TU is NP-complete...
Persistent link: https://www.econbiz.de/10012730479
We consider here the mixing set with flows: s + xt amp;#8805; bt, xt amp;#8804; yt for 1 amp;#8804; t amp;#8804; n; s E IR, x E IR, y E Z. It models the flow version of the basic mixing set introduced and studied by Guuml;nluuml;k and Pochet, as well as the most simple stochastic lot-sizing problem with...
Persistent link: https://www.econbiz.de/10012734276
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the...
Persistent link: https://www.econbiz.de/10008494367
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....
Persistent link: https://www.econbiz.de/10005043575
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....
Persistent link: https://www.econbiz.de/10005043064
Persistent link: https://www.econbiz.de/10003311775
Persistent link: https://www.econbiz.de/10012697427