Difference between revisions of "Lotka Volterra fishing problem"
From mintOC
Line 62: | Line 62: | ||
== Source Code == | == Source Code == | ||
− | < | + | <source lang="cpp"> |
double ref0 = 1, ref1 = 1; /* steady state with u == 0 */ | double ref0 = 1, ref1 = 1; /* steady state with u == 0 */ | ||
Line 68: | Line 68: | ||
rhs[1] = - xd[1] + xd[0]*xd[1] - p[1]*u[0]*xd[1]; | rhs[1] = - xd[1] + xd[0]*xd[1] - p[1]*u[0]*xd[1]; | ||
rhs[2] = (xd[0]-ref0)*(xd[0]-ref0) + (xd[1]-ref1)*(xd[1]-ref1); | rhs[2] = (xd[0]-ref0)*(xd[0]-ref0) + (xd[1]-ref1)*(xd[1]-ref1); | ||
− | </ | + | </source> |
== Miscellaneous == | == Miscellaneous == | ||
Line 77: | Line 77: | ||
</graphviz> | </graphviz> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== External references == | == External references == | ||
[[Category:ODE Model]] | [[Category:ODE Model]] |
Revision as of 10:17, 4 July 2008
This problem was set up as a simple benchmark problem. Despite of its simple structure, the optimal solution contains a singular arcs, making the Lotka Volterra fishing problem an ideal candidate for benchmarking of algorithms.
In this problem the Lotka Volterra equations for a predator-prey system have been augmented by an additional linear term, relating to fishing by man.
Model dimensions and properties
The model has the following dimensions:
It is thus an ODE model with a single integer control function. The interior point equality conditions fix the initial values of the differential states.
Mathematical formulation
For the mixed-integer optimal control problem is given by
Initial values and parameters
Reference Solutions
Source Code
double ref0 = 1, ref1 = 1; /* steady state with u == 0 */ rhs[0] = xd[0] - xd[0]*xd[1] - p[0]*u[0]*xd[0]; rhs[1] = - xd[1] + xd[0]*xd[1] - p[1]*u[0]*xd[1]; rhs[2] = (xd[0]-ref0)*(xd[0]-ref0) + (xd[1]-ref1)*(xd[1]-ref1);
Miscellaneous
Testing Graphviz
<graphviz border='frame' format='svg'> digraph G {Hello->World!} </graphviz>