Lotka Volterra fishing problem: Difference between revisions
No edit summary |
|||
| Line 71: | Line 71: | ||
== Miscellaneous == | == Miscellaneous == | ||
Testing Graphviz | |||
<graphviz border='frame' format='svg'> | <graphviz border='frame' format='svg'> | ||
digraph G {Hello->World!} | digraph G {Hello->World!} | ||
</graphviz> | </graphviz> | ||
Testing Syntax Highlighting | |||
<source lang="csharp"> | |||
// Hello World in Microsoft C# ("C-Sharp"). | |||
using System; | |||
class HelloWorld | |||
{ | |||
public static int Main(String[] args) | |||
{ | |||
Console.WriteLine("Hello, World!"); | |||
return 0; | |||
} | |||
} | |||
</source> | |||
== External references == | == External references == | ||
[[Category:ODE Model]] | [[Category:ODE Model]] | ||
Revision as of 09:13, 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>
Testing Syntax Highlighting
// Hello World in Microsoft C# ("C-Sharp").
using System;
class HelloWorld
{
public static int Main(String[] args)
{
Console.WriteLine("Hello, World!");
return 0;
}
}
