Difference between revisions of "Double Tank multimode problem"
From mintOC
ClemensZeile (Talk | contribs) |
ClemensZeile (Talk | contribs) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
{{Dimensions | {{Dimensions | ||
|nd = 1 | |nd = 1 | ||
− | |nx = | + | |nx = 2 |
|nw = 3 | |nw = 3 | ||
|nre = 2 | |nre = 2 | ||
Line 37: | Line 37: | ||
<gallery caption="Reference solution plots" widths="180px" heights="140px" perrow="2"> | <gallery caption="Reference solution plots" widths="180px" heights="140px" perrow="2"> | ||
− | Image: | + | Image:MmdoubletankRelaxed 12000 120 1.png| Optimal relaxed controls and states determined by an direct approach with ampl_mintoc (Radau collocation) and <math>n_t=12000, \, n_u=100</math>. |
Image:MmdoubletankCIA_12000_120_1.png| Optimal binary controls and states determined by an direct approach (Radau collocation) with ampl_mintoc and <math>n_t=12000, \, n_u=100</math>. The relaxed controls were approximated by Combinatorial Integral Approximation. | Image:MmdoubletankCIA_12000_120_1.png| Optimal binary controls and states determined by an direct approach (Radau collocation) with ampl_mintoc and <math>n_t=12000, \, n_u=100</math>. The relaxed controls were approximated by Combinatorial Integral Approximation. | ||
</gallery> | </gallery> | ||
+ | == Source Code == | ||
+ | Model description is available in | ||
+ | * [[:Category:AMPL | AMPL code]] at [[Double Tank multimode problem (AMPL)]] | ||
Line 54: | Line 57: | ||
[[Category:Chattering]] | [[Category:Chattering]] | ||
[[Category:Sensitivity-seeking arcs]] | [[Category:Sensitivity-seeking arcs]] | ||
− | + | ||
Latest revision as of 08:37, 14 March 2020
Double Tank multimode problem | |
---|---|
State dimension: | 1 |
Differential states: | 2 |
Discrete control functions: | 3 |
Interior point equalities: | 2 |
This site describes a Double tank problem variant with three binary controls instead of only one control.
Mathematical formulation
The mixed-integer optimal control problem is given by
Parameters
These fixed values are used within the model.
Reference Solutions
If the problem is relaxed, i.e., we demand that be in the continuous interval instead of the binary choice , the optimal solution can be determined by means of direct optimal control.
The optimal objective value of the relaxed problem with is . The objective value of the binary controls obtained by Combinatorial Integral Approimation (CIA) is .
Source Code
Model description is available in