Jump to content

Lotka Volterra absolute fishing problem

From mintOC
Lotka Volterra absolute fishing problem
State dimension: 1
Differential states: 3
Discrete control functions: 5
Interior point equalities: 3

This site describes a Lotka Volterra variant with five binary controls that all represent fishing of an absolute biomass.

Mathematical formulation

The mixed-integer optimal control problem is given by

minx,wx2(tf)s.t.x˙0=x0x0x1i=15c0,iwi,x˙1=x1+x0x1i=15c1,iwi,x˙2=(x01)2+(x11)2,x(0)=(0.5,0.7,0)T,i=15wi(t)=1,wi(t){0,1},i=15.

Here the differential states (x0,x1) describe the biomasses of prey and predator, respectively. The third differential state is used here to transform the objective, an integrated deviation, into the Mayer formulation minx2(tf). This problem variant allows to choose between five different fishing options.

Parameters

These fixed values are used within the model.

[t0,tf]=[0,12],(c0,1,c1,1)=(0.2,0.1),(c0,2,c1,2)=(0.4,0.2),(c0,3,c1,3)=(0.01,0.1),(c0,4,c1,4)=(0,0),(c0,5,c1,5)=(0.1,0.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.