Category:Boolean variables

From mintOC
Revision as of 18:54, 20 January 2016 by JonasSchulze (Talk | contribs) (Text replacement - "\<bibref\>(.*)\<\/bibref\>" to "<bib id="$1" />")

Jump to: navigation, search

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

\delta_i: [0, t_f] \mapsto \{ \mathrm{true}, \mathrm{false} \}

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 [Grossmann2002]Author: I.E. Grossmann
Journal: Optimization and Engineering
Pages: 227--252
Title: Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques
Volume: 3
Year: 2002
Link to Google Scholar
[Oldenburg2005]Address: D\"usseldorf
Author: J. Oldenburg
Publisher: VDI Verlag
Series: Fortschritt-Berichte VDI Reihe 3, Verfahrens\-technik
Title: Logic--based modeling and optimization of discrete--continuous dynamic systems
Volume: 830
Year: 2005
Link to Google Scholar
[Oldenburg2008]Author: J. Oldenburg; W. Marquardt
Journal: Computers \& Chemical Engineering
Number: 10
Pages: 2346--2364
Title: Disjunctive modeling for optimal control of hybrid systems
Volume: 32
Year: 2008
Link to Google Scholar
.

References

<bibreferences/>

This category currently contains no pages or media.