Jump to content

D'Onofrio model (binary variant)

From mintOC
Revision as of 09:02, 2 February 2026 by RobertLampel (talk | contribs) (Mathematical formulation)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
D'Onofrio model (binary variant)
State dimension: 1
Differential states: 4
Discrete control functions: 4
Path constraints: 2

This site describes a D'Onofrio model variant with four binary controls instead which of only two continuous controls. The continuous controls are replaced via the outer convexifacation method.

Mathematical formulation

For t[t0,tf] the optimal control problem is given by

minx,ux0(tf)+αt0tfu0(t)2dts.t.x˙0=ζx0ln(x0x1)i=14wic1,iFx0,x˙1=bx0μx1dx023x1i=14wic0,iGx1i=14wic1,iηx1,x˙2=i=14wic0,i,x˙3=i=14wic1,i,x2x2max,x3x3max,1=i=14wi(t),wi(t){0,1},i=14.

Parameters

The parameters and scenarios are as in D'Onofrio_chemotherapy_model, the new fixed parameters are

(c0,1,c0,2,c0,3,c0,4)=(u0max,u0max,0,0),(c1,1,c1,2,c1,3,c1,4)=(0,u1max,u1max,0).

Reference Solutions

If the problem is relaxed, i.e., we demand that w(t) be in the continuous interval [0,1] instead of the binary choice {0,1}, the optimal solution can be determined by using a direct method such as collocation or Bock's direct multiple shooting method.


The optimal objective value of scenario 2 of the relaxed problem with nt=6000,nu=100 is 19.3561387. The objective value of the binary controls obtained by Combinatorial Integral Approimation (CIA) is 169.45773. The binary control solution was evaluated in the MIOCP by using a Merit function with additional Mayer term 100maxt[0,1]{0,x2(t)x2max}+1000maxt[0,1]{0,x3(t)x3max}.


Source Code

Model description is available in