Jump to content

LV Shared Resource: Difference between revisions

From mintOC
Line 33: Line 33:
<math>
<math>
\begin{array}{rcl}
\begin{array}{rcl}
[t_0, t_f] &=& [0, 12],\\
[t_0, t_f] &=& [0, 40],\\
(c_{0,1}, c_{1,1}) &=& (0.2, 0.1),\\
(c_{1}, c_{2}) &=& (0.1, 0.4),\\
(c_{0,2}, c_{1,2}) &=& (0.4, 0.2),\\
x_0 &=& (1.5, 0.5, 1) \text{ or } (1.5, 1, 0.5),\\
(c_{0,3}, c_{1,3}) &=& (0.01, 0.1),\\
\alpha &=& 1.2.
(c_{0,4}, c_{1,4}) &=& (0, 0),\\
(c_{0,5}, c_{1,5}) &=& (-0.1, -0.2).
\end{array}
\end{array}
</math>
</math>

Revision as of 07:01, 25 August 2025

LV Shared Resource
State dimension: 1
Differential states: 3
Discrete control functions: 5
Interior point equalities: 3


This Lotka Volterra problem with explicit inclusion of a shared resource is a variant of the Lotka Volterra fishing problem. Its dynamics are given via a three-dimensional ODE model.

Mathematical formulation

The optimal control problem is given by

minu0tf(x0(t)1.5)2+(x1(t)1)2+(x2(t)1)2 dts.t.x˙0=x0(t)x0(t)x1(t)x0(t)x2(t),x˙1=x1(t)+x0(t)x1(t)c1x1(t)u(t),x˙2=x2(t)+αx0(t)x2(t)c2x2(t)u(t),x(0)=x0,u(t)[0,1],α>1.

Parameters

These fixed values are used within the model.

[t0,tf]=[0,40],(c1,c2)=(0.1,0.4),x0=(1.5,0.5,1) or (1.5,1,0.5),α=1.2.

Reference Solutions

If the problem is relaxed, i.e., we demand that w(t) is in the continuous interval [0,1] rather than being binary, the optimal solution can be determined by means of direct optimal control.

The optimal objective value of the relaxed problem with nt=12000,nu=150 is x2(tf)=0.345768563. The objective value of the solution with binary controls obtained by Combinatorial Integral Approximation (CIA) is x2(tf)=0.348617982.