In (1) the question was posed how to model production runs that have an exact length. Although the question was asked in terms of integer variables, this is much easier to deal with when we have binary variables. Let’s introduce a binary variable:
xt={1when the unit x is turned on in period t0otherwise |
The question was formulated as an implication:
xt=1⟹xt+1=xt+2=1 |
This implication is not 100% correct: it would turn on x forever. But we understand what the poster meant, if a unit is turned on, it should stay on for exactly three periods.
This condition can be more correctly stated as the implication:
xt−1=0 and xt=1⟹xt+1=xt+2=1 and xt+3=0 |
We can make linear inequalities out of this as follows:
xt+1≥xt−xt−1xt+2≥xt−xt−11−xt+3≥xt−xt−1 |
If we want to model the condition “a unit should stay on for at least three periods”, we can drop the last constraint and just keep:
xt+1≥xt−xt−1xt+2≥xt−xt−1 |
No comments:
Post a Comment