Category:Boolean variables

Discrete switching events can also be expressed by means of Boolean variables and logical implications. E.g., by introducing logical functions

δ_{i} : [0, t_{f}] \mapsto {t r u e, f a l s e}

that indicate whether a model formulation $F_{i} [x, u, v]$ is active at time $t$ , both state-dependent switches and outer convexification formulations may be written as disjunctive programs, i.e., optimization problems involving Boolean variables and logical conditions. Using disjunctive programs can be seen as a more natural way of modeling discrete events and has the main advantage of resulting in tighter relaxations of the discrete dicisions, when compared to integer programming techniques. More details can be found, e.g., in <bibref>Grossmann2002</bibref><bibref>Oldenburg2005</bibref><bibref>Oldenburg2008</bibref>.

References

This category currently contains no pages or media.