Article ID Journal Published Year Pages File Type
1143488 Operations Research Letters 2008 8 Pages PDF
Abstract
The continuous mixing set is S={(s,r,z)∈ℜ×ℜ+n×Zn:s+rj+wjzj≥fj,j=1,…,n}, where w1,…,wn>0 and f1,…,fn∈ℜ. Let m=|{w1,…,wn}|. We show that when w1|⋯|wn, optimization over S can be performed in time O(nm+1), and in time O(nlogn) when w1=⋯=wn=1.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,