Previous Article in Journal
Benchmarking Point Cloud Feature Extraction with Smooth Overlap of Atomic Positions (SOAP): A Pixel-Wise Approach for MNIST Handwritten Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Optimal Control Problems for Wastewater Treatment with Different Types of Bacteria

1
Laboratoire de Mathématiques Informatique et Applications (LAMIA), Université des Antilles, EA4540, Campus de Fouillole, BP 250, 97159 Pointe-à-Pitre CEDEX, France
2
DFR Sciences et Technologies, Université de Guyane, Campus de Troubiran, BP 20792, 97337 Cayenne CEDEX, France
*
Author to whom correspondence should be addressed.
AppliedMath 2025, 5(2), 73; https://doi.org/10.3390/appliedmath5020073 (registering DOI)
Submission received: 8 April 2025 / Revised: 9 May 2025 / Accepted: 12 May 2025 / Published: 13 June 2025

Abstract

:
The aim of this paper is to propose mathematical models to predict and optimize the cost of wastewater treatment using bacteria and oxygen under fluctuating resource and cultivation conditions. We have thus developed deterministic mathematical models based on dynamic systems and applied optimal control theory to reduce treatment costs. Two wastewater treatment models are proposed: one using only one type of aerobic bacteria, thermophilic bacteria; and the second using two types of aerobic bacteria, thermophilic and mesophilic bacteria. For each model, an optimal control problem is solved and numerical simulations illustrate the theoretical results.

1. Introduction

Over the past 40 years, water resources have become increasingly significant. This is due to the growth of the global population and the rapid development of industries, causing serious environmental challenges because of the large quantities of wastewater that are released [1,2,3,4]. After use, the majority of wastewater is discharged without any pre-treatment, resulting in the degradation of water quality, since the flow of wastewater discharge is too significant for natural regeneration. Many countries have established regulation limits on the discharge rate into the environment. Consequently, wastewater must be treated before being discharged into natural bodies of water. Various processes are employed to reduce the negative impacts on environment and health.
Wastewater treatment processes require several phases, each one addressing a specific type of pollution. The activated sludge treatment phase, whose operating principle is described in [5,6,7,8,9], is the key phase of the treatment chain. This activated sludge treatment process consists of bringing the organic matter in the wastewater into contact with a bacterial population. The bacteria assimilate the organic matter for their own development. This process is called activated sludge treatment because all conditions that maximize bacteria activity are implemented such as sufficient oxygen supply, nutrient addition if the effluent does not contain all the compounds necessary for bacteria development, continuous agitation to promote contact between bacteria and pollutants, and a high concentration of bacteria to increase treatment efficiency. Activated sludge treatment is very effective but energy-intensive, since non-pathogenic bacteria need to be in well-oxygenated water to assimilate pollutants, and oxygenation consumes a large amount of energy. Different control strategies for the activated sludge process have been carried out to reduce treatment costs [5,9,10,11,12].
The contribution of this work is divided into two parts: The first part concerns wastewater treatment with only one type of bacteria, and the second part concerns two types of bacteria. In the second section, we extend a model proposed by Grigorieva et al. in [13], in which we add a substrate production term due to bacterial death. We separately study two optimal control problems: the first one to minimize the concentration of pollutants at the end of treatment, and the second one to minimize the concentration of pollutants throughout treatment. For these problems, the control variable is the oxygen injection rate in the reactor. By applying the Pontryagin maximum principle, we characterize in each case the optimal control, and numerical simulations are then performed to illustrate our theoretical study. In the third section, we extend the model proposed in the second one by considering two types of aerobic bacteria, mesophilic and thermophilic ones, as these are present in the case of wastewater treatment [14]. In this case, we consider an optimal control problem consisting of minimizing the weighted sum of the pollutants’ concentrations at the end of the treatment and the operational costs of oxygen pumping, again by controlling the oxygen injection rate. By applying the Pontryagin maximum principle, we characterize the optimal control and numerical simulations are given to illustrate our theoretical study. The techniques and methods used in this paper are almost similar to those of [13] but more complicated due to the addition of terms and equations.

2. Study of Two Optimal Control Problems for a Wastewater Treatment Model with One Type of Bacteria

The mathematical model that we propose is an extension of the one in [13] and can be formulated as a system of three ordinary differential equations:
x ˙ ( t ) = x ( t ) y ( t ) z ( t ) + u ( t ) ( m x ( t ) ) , t [ 0 , T ] , y ˙ ( t ) = x ( t ) y ( t ) z ( t ) + f z ( t ) , z ˙ ( t ) = x ( t ) y ( t ) z ( t ) α z ( t ) , x ( 0 ) = x 0 ( 0 , m ) , y ( 0 ) = y 0 > 0 , z ( 0 ) = z 0 > 0
where x ( . ) is the concentration of oxygen, y ( . ) is the concentration of pollutants, z ( . ) is the concentration of thermophilic aerobic bacteria, u ( . ) is the oxygen pumping rate, m is the oxygen saturation point in the treatment unit, α is the natural mortality rate of bacteria, f is the fraction of dead bacteria transformed into a new pollutant, and T is the treatment duration. With this model, we assume that the reaction is described by the mass action law introduced in [15], which characterizes the chemical reaction as a function of the concentration of the initial substances. We consider variables without dimensions, as it is usually considered in studies of this type [16,17]. As in [13], each variable is normalized with some limiting value that exists, as we will see in the following Proposition 1. Moreover, for all t [ 0 , T ] , x ( t ) < m , and this will be proven in the following Proposition 1.
The first equation of System (1) describes the evolution of oxygen concentrations in the reactor. The first term describes the oxygen absorption process in the reaction, while the second one is the inflow of oxygen (through pumping) into the reactor from the outside. Dissolved oxygen is replenished by aeration, subject to the saturation concentration m. Here, u ( . ) is the aeration rate, which will also be the control function in the following. In the second equation, the first term describes a decrease in organic matter in the reaction and the second one is the production of organic matter due to bacterial decomposition, with a recycled fraction f as substrate. The third equation describes the evolution of aerobic bacteria. The first term describes its growth and the second term describes its reduction due to natural mortality at a rate α with α > f . It is important to notice that this model (1) is different from the one in [13] due to the addition of the term f z ( . ) representing the formation of new pollutants as the substrate. Indeed, in the model proposed by Grigorieva et al. in [13], the term f z ( . ) does not exist. The addition of this term is justified by the fact that the natural death of the bacteria leads to the production of a certain amount of pollutants, which also justifies the choice of the hypothesis f < α .
Moreover, the set of admissible controls, denoted by U , is the set of all Lebesgue measurable functions u ( t ) such that, for almost every t [ 0 , T ] ,
0 u ( t ) u max ,
where u max is the maximum aeration rate. Our goal is to separately solve the two following optimal control problems:
( P ) J ( u ) = y ( T ) min u U
and
( P ) ˜ J ˜ ( u ) = 0 T y ( t ) d t min u U .
Proposition 1.
For all control u ( . ) U , all trajectories x ( . ) , y ( . ) , and z ( . ) of (1), starting in the positive orthant, are bounded and, for all t 0 ,
0 < x ( t ) < m , 0 < y ( t ) < y m a x , 0 < z ( t ) < z max ,
where y m a x = y 0 + f z m a x T a n d z max = x 0 + z 0 + m u m a x T .
Proof. 
By using the third equation of System (1), we get
z ( t ) = z 0 exp 0 t ( x ( ϵ ) y ( ϵ ) α ) d ϵ .
It follows that, for all t 0 , z ( t ) > 0 . Next, using the second equation of System (1), we get
y ( t ) = exp 0 t x ( ϵ ) z ( ϵ ) d ϵ y 0 + f 0 t exp 0 s ( x ( ϵ ) z ( ϵ ) d ϵ z ( s ) d s .
Hence, for all t 0 , y ( t ) > 0 . Finally, with the first equation of System (1), we have
x ( t ) = exp 0 t y ( ϵ ) z ( ϵ ) + u ( ϵ ) d ϵ x 0 + m 0 t exp 0 s y ( ϵ ) z ( ϵ ) + u ( ϵ ) d ϵ u ( s ) d s .
Consequently, x ( t ) > 0 for all t 0 . Let us now prove that these solutions are bounded. First, we show that x ( t ) < m , for all t 0 . For this, we consider the function γ ( t ) = m x ( t ) and use the first equation of System (1) to obtain that γ is the solution to the Cauchy problem:
{ γ ˙ ( t ) = ( y ( t ) z ( t ) + u ( t ) ) γ ( t ) + m y ( t ) z ( t ) γ ( 0 ) = γ 0 = m x 0 > 0 .
We remark that γ could be expressed by
γ ( t ) = exp 0 t ( y ( ϵ ) z ( ϵ ) + u ( ϵ ) ) d ϵ γ 0 + m 0 t exp ( 0 s ( y ( ϵ ) z ( ϵ ) + u ( ϵ ) ) d ϵ ) y ( s ) z ( s ) d s ,
and it is easy to see that for all t 0 , γ ( t ) > 0 , which implies that x ( t ) < m , for all t 0 .
Then, adding the first and the third equations of System (1), we get
x ˙ ( t ) + z ˙ ( t ) = α z ( t ) + u ( t ) ( m x ( t ) ,
which is equivalent to
x ( t ) + z ( t ) = x 0 + z 0 α 0 t z ( ϵ ) d ϵ + 0 t u ( ϵ ) ( m x ( ϵ ) ) d ϵ ,
and implies that
x ( t ) + z ( t ) < x 0 + z 0 + m 0 t u ( ϵ ) d ϵ .
Using Inequality (2), we find that x ( t ) + z ( t ) < x 0 + z 0 + m u m a x T = z m a x , for all t [ 0 , T ] , which implies that z ( t ) < z m a x , for all t [ 0 , T ] . Finally, from (7), we get
y ( t ) = y 0 exp 0 t x ( ϵ ) z ( ϵ ) d ϵ + f 0 t exp s t x ( ϵ ) z ( ϵ ) d ϵ z ( s ) d s .
Then, y ( t ) < y 0 + f 0 t z ( s ) d s implies that y ( t ) < y 0 + f z m a x T = y m a x , for all t [ 0 , T ] . □
Proposition 2.
The two optimal control problems (3) and (4) are well posed in the sense that for each control u U , there is one and only one solution to the Cauchy problem (1).
Proof. 
For all u U , we define the function F by F ( t , X ( t ) ) = f ( t , X ( t ) , u ( t ) ) with
X ( t ) = ( x ( t ) , y ( t ) , z ( t ) ) ,
f ( t , X ( t ) , u ( t ) ) = f 1 ( t , X ( t ) , u ( t ) ) , f 2 ( t , X ( t ) , u ( t ) ) , f 3 ( t , X ( t ) , u ( t ) )
and
f 1 ( t , X ( t ) , u ( t ) ) = x ( t ) y ( t ) z ( t ) + u ( t ) ( m x ( t ) ) , f 2 ( t , X ( t ) , u ( t ) ) = x ( t ) y ( t ) z ( t ) + f z ( t ) , f 3 ( t , X ( t ) , u ( t ) ) ) = x ( t ) y ( t ) z ( t ) α z ( t ) .
It is clear that F is measurable, integrable with respect to t, continuous and locally Lipschitzian with respect to X. Consequently, the Cauchy problem (1) has a unique maximal solution. □
Theorem 1.
The optimal control problem (3) (respectively, (4)) admits an optimal control u * U (respectively, u ˜ * U ) such that the associated trajectory ( x * , y * , z * ) (respectively, ( x ˜ * , y ˜ * , z ˜ * ) ) is a solution of the dynamical System (1).
Proof. 
It is a consequence of the two previous propositions and the fact that the right-hand sides of the equations of System (1) are convex with respect to u. □

2.1. Study of the Optimal Control Problem ( P )

In this section, we will characterize the optimal control u * associated with problem ( P ) .
By applying the Pontryagin maximum principle [18] for the control u * ( t ) and the corresponding solution X * ( t ) , there exists a non-trivial solution ψ * ( t ) = ψ 1 * ( t ) , ψ 2 * ( t ) , ψ 3 * ( t ) of the adjoint system:
ψ ˙ 1 * ( t ) = u * ( t ) ψ 1 * ( t ) + y * ( t ) z * ( t ) ψ 1 * ( t ) + ψ 2 * ( t ) ψ 3 * ( t ) ψ ˙ 2 * ( t ) = x * ( t ) z * ( t ) ψ 1 * ( t ) + ψ 2 * ( t ) ψ 3 * ( t ) ψ ˙ 3 * ( t ) = x * ( t ) y * ( t ) ψ 1 * ( t ) + ψ 2 * ( t ) ψ 3 * ( t ) + α ψ 3 * ( t ) f ψ 2 * ( t ) ψ 1 * ( T ) = 0 , ψ 2 * ( T ) = 1 , ψ 3 * ( T ) = 0 ,
such that the control u * ( t ) maximizes the Hamiltonian H defined by
H x , y , z , ψ 1 , ψ 2 , ψ 3 , u = x y z + u ( m x ) ψ 1 + x y z + f z ψ 2 + x y z α z ψ 3 .
But 0 u * ( t ) u m a x , for almost all t [ 0 , T ] , so
u * ( t ) = u m a x i f L ( t ) > 0 , u * [ 0 , u m a x ] i f L ( t ) = 0 , 0 i f L ( t ) < 0 ,
where L ( t ) = ψ 1 * ( t ) is the switching function of problem ( P ) .
In order to study the behaviour of the switching function L ( . ) , we introduce the following auxiliary functions:
G ( t ) = ψ 1 * ( t ) + ψ 2 * ( t ) ψ 3 * ( t ) a n d P ( t ) = ψ 3 * ( t ) + α 1 f ψ 2 * ( t ) .
The adjoint System (10) associated with problem ( P ) can be rewritten with the functions L ( . ) , G ( . ) , and P ( . ) as
L ˙ ( t ) = u * ( t ) L ( t ) + y * ( t ) z * ( t ) G ( t ) G ˙ ( t ) = u * ( t ) L ( t ) + h ( t ) G ( t ) + α P ( t ) P ˙ ( t ) = ρ ( t ) G ( t ) + α P ( t ) L ( T ) = 0 , G ( T ) = 1 , P ( T ) = α 1 f ,
where ρ ( t ) = α 1 f x * ( t ) z * ( t ) x * ( t ) y * ( t ) and h ( t ) = y * ( t ) z * ( t ) + x * ( t ) z * ( t ) x * ( t ) y * ( t ) .
The analysis of System (12) allows us to obtain the following propositions, which give us properties on the switching function L ( . ) .
Proposition 3.
The switching function L cannot vanish on any finite subinterval of [ 0 , T ] .
Proof. 
Let us assume that there exists an interval D [ 0 , T ] such that for all t D , L ( t ) = 0 . Then, for all t D , L ˙ ( t ) = 0 . According to the first equation of System (12), we obtain that G ( t ) = 0 for all t D . Thus, G ˙ ( t ) = 0 for all t D . From the second equation of (12), we determine that P ( t ) = 0 , for t D ; thus, we have P ˙ ( . ) = 0 throughout the interval D. Consequently, the third equation of System (12) is also satisfied. We thus find
L ( t ) = 0 , G ( t ) = 0 , P ( t ) = 0 , t D .
Moreover, System (12) is in fact a system of non-autonomous homogeneous linear differential equations, and thus (13) holds everywhere on [ 0 , T ] . From (13) and the definition of L ( . ) , we have ψ 1 * ( t ) = 0 . Furthermore, G ( t ) = 0 implies that ψ 1 * ( t ) + ψ 2 * ( t ) ψ 3 * ( t ) = 0 ; hence, ψ 2 * ( t ) = ψ 3 * ( t ) . Finally, P ( t ) = 0 gives ψ 3 * ( t ) + α 1 f ψ 2 * ( t ) = 0 ; thus, ( 1 α 1 f ) ψ 2 * ( t ) = 0 . Since f < α , we have α 1 f < 1 , and hence, ψ 2 * ( t ) = 0 . Therefore,
ψ 1 * ( t ) = 0 , ψ 2 * ( t ) = 0 , ψ 3 * ( t ) = 0 , t [ 0 , T ] ,
that is, the function ψ * ( . ) is trivial on [ 0 , T ] , which is absurd and completes the proof. □
Remark 1.
From (11) and Proposition 3, it follows that the control u * ( t ) is a piecewise constant function such that
u * ( t ) = u m a x i f L ( t ) > 0 , 0 i f L ( t ) < 0 .
Proposition 4.
On the interval [ 0 , T ] , the switching function L has at most two zeros.
Proof. 
We will use the method given in [19]. The proof is carried out in three steps.
In the first step, we perform a variable change to reduce the matrix of the non-autonomous linear System (12) to an upper triangular form. The variable changes are
r ( t ) = L ( t ) , v ( t ) = G ( t ) , μ ( t ) = P ( t ) + q 1 ( t ) L ( t ) + q 2 ( t ) G ( t ) ,
where the functions q 1 ( t ) and q 2 ( t ) will be specified later. With these variable changes, System (12) becomes
r ˙ ( t ) = u * ( t ) r ( t ) + y * ( t ) z * ( t ) v ( t ) v ˙ ( t ) = ( u * ( t ) α q 1 ( t ) ) r ( t ) + ( h ( t ) α q 2 ( t ) ) v ( t ) + α μ ( t ) μ ˙ ( t ) = q 1 ˙ ( t ) + ( u ( t ) α ) q 1 ( t ) α q 1 ( t ) q 2 ( t ) + q 2 ( t ) u ( t ) r ( t ) + { q 2 ˙ ( t ) + ( h ( t ) α ) q 2 ( t ) α q 2 2 ( t ) + y * ( t ) z * ( t ) q 1 ( t ) + ρ ( t ) } v ( t ) + α ( 1 + q 2 ( t ) ) μ ( t ) .
We choose q 1 ( . ) and q 2 ( . ) so that the expressions between braces are zero; therefore, System (15) becomes
r ˙ ( t ) = u * ( t ) r ( t ) + y * ( t ) z * ( t ) v ( t ) v ˙ ( t ) = ( u * ( t ) α q 1 ( t ) ) r ( t ) + ( h ( t ) α q 2 ( t ) ) v ( t ) + α μ ( t ) μ ˙ ( t ) = α ( 1 + q 2 ( t ) ) μ ( t ) .
For System (16), we then make the following substitutions:
r ^ ( t ) = r ( t ) , v ^ ( t ) = v ( t ) + q 3 ( t ) r ( t )   and   μ ^ ( t ) = μ ( t ) ,
where the function q 3 ( . ) will be determined later. System (16) is then rewritten as follows:
r ^ ˙ ( t ) = ( u * ( t ) y * ( t ) z * ( t ) q 3 ( t ) ) r ^ ( t ) + y * ( t ) z * ( t ) v ^ ( t ) v ^ ˙ ( t ) = { q 3 ˙ ( t ) + ( u * ( t ) h ( t ) ) q 3 ( t ) y * ( t ) z * ( t ) q 3 2 ( t ) + α q 2 ( t ) q 3 ( t ) + u * ( t ) α q 1 ( t ) } r ^ ( t ) + [ h ( t ) α q 2 ( t ) + y * ( t ) z * ( t ) q 3 ( t ) ] v ^ ( t ) + α μ ^ ( t ) μ ^ ˙ ( t ) = α ( 1 + q 2 ( t ) ) μ ^ ( t ) .
We choose q 3 ( . ) so that the expression between braces is zero; therefore, System (17) becomes
r ^ ˙ ( t ) = u * ( t ) y * ( t ) z * ( t ) q 3 ( t ) r ^ ( t ) + y * ( t ) z * ( t ) v ^ ( t ) v ^ ˙ ( t ) = h ( t ) α q 2 ( t ) + y * ( t ) z * ( t ) q 3 ( t ) v ^ ( t ) + α μ ^ ( t ) μ ^ ˙ ( t ) = α 1 + q 2 ( t ) μ ^ ( t ) .
By definition of q 1 ( . ) , q 2 ( . ) , and q 3 ( . ) , we have the following non-autonomous system of quadratic differential equations:
q 1 ˙ ( t ) = ( α u * ( t ) ) q 1 ( t ) + α q 1 ( t ) q 2 ( t ) u * ( t ) q 2 ( t ) q 2 ˙ ( t ) = ( α h ( t ) ) q 2 ( t ) + α q 2 2 ( t ) y * ( t ) z * ( t ) q 1 ( t ) ρ ( t ) q 3 ˙ ( t ) = ( h ( t ) u * ( t ) ) q 3 ( t ) + y * ( t ) z * ( t ) q 3 2 ( t ) α q 2 ( t ) q 3 ( t ) + α q 1 ( t ) u * ( t ) .
The continuity of the solutions to non-autonomous systems of quadratic differential equations has been considered in [20,21], where it has been found that adding the initial conditions q 1 ( 0 ) = q 1 0 , q 2 ( 0 ) = q 2 0 , and q 3 ( 0 ) = q 3 0 to System (19) ensures that the corresponding solution q ( . ) = ( q 1 ( . ) , q 2 ( . ) , q 3 ( . ) ) is defined on the interval [ 0 , t max ) , which is the largest interval on which this solution exists, with either t max = + or t max < + . It is also possible that t max T .
In the second step, we prove the existence of a solution q ˜ ( . ) for (19) defined over the entire interval [ 0 , T ] . Moreover, System (19) can be rewritten as follows:
q 1 ˙ ( t ) = q ( t ) M 1 ( t ) q ( t ) + b 1 ( t ) q ( t ) + k 1 ( t ) , q 2 ˙ ( t ) = q ( t ) M 2 ( t ) q ( t ) + b 2 ( t ) q ( t ) + k 2 ( t ) , q 3 ˙ ( t ) = q ( t ) M 3 ( t ) q ( t ) + b 3 ( t ) q ( t ) + k 3 ( t ) ,
where
M 1 ( t ) = 0 α 2 0 α 2 0 0 0 0 0 , M 2 ( t ) = 0 0 0 0 α 0 0 0 0 , M 3 ( t ) = 0 0 0 0 0 α 2 0 α 2 y * ( t ) z * ( t ) ,
b 1 ( t ) = α u * ( t ) u * ( t ) 0 , b 2 ( t ) = y * ( t ) z * ( t ) α h ( t ) 0 , b 3 ( t ) = α 0 h ( t ) u * ( t ) ,
k 1 ( t ) = 0 , k 2 ( t ) = ρ ( t ) a n d k 3 ( t ) = u * ( t ) .
Now, suppose that for any arbitrary solution of System (20), t 1 ( 0 , T ] is defined on the interval [ 0 , t 1 ) , which is the largest interval over which this solution exists. Thus,
lim t t 1 | q ( t ) | = + ,
where | q ( t ) | = q 1 2 ( t ) + q 2 2 ( t ) + q 3 2 ( t ) here and in the following. This relation implies the existence of a real number ρ 1 > 0 and a t 0 [ 0 , t 1 ) such that | q ( t ) | ρ 1 , for all t [ t 0 , t 1 ) . The values of ρ 1 and t 0 will be defined below.
Moreover, using the fact that
| q ( t ) | 2 = q 1 2 ( t ) + q 2 2 ( t ) + q 3 2 ( t )
and
2 d d t | q ( t ) | | q ( t ) | = 2 q 1 ˙ ( t ) q 1 ( t ) + q 2 ˙ ( t ) q 2 ( t ) + q 3 ˙ ( t ) q 3 ( t ) ,
we have
d d t | q ( t ) | | q ( t ) | = q 1 ˙ ( t ) q 1 ( t ) + q 2 ˙ ( t ) q 2 ( t ) + q 3 ˙ ( t ) q 3 ( t ) .
From (20), we obtain
d d t | q ( t ) | = | q ( t ) | 1 ( q 1 ( t ) q ( t ) M 1 ( t ) q ( t ) + q 2 ( t ) q ( t ) M 2 ( t ) q ( t ) + q 3 ( t ) q ( t ) M 3 ( t ) q ( t ) + [ q 1 ( t ) b 1 ( t ) q ( t ) + q 2 ( t ) b 2 ( t ) q ( t ) + q 3 ( t ) b 3 ( t ) q ( t ) + q 1 ( t ) k 1 ( t ) + q 2 ( t ) k 2 ( t ) + q 3 ( t ) k 3 ( t ) )
We use Proposition 1 and (2) to find an upper bound for the expressions between brackets in (22). First, we consider the expression between the third bracket of (22). Let k ( t ) = ( k 1 ( t ) , k 2 ( t ) , k 3 ( t ) ) . We get
q 1 ( t ) k 1 ( t ) + q 2 ( t ) k 2 ( t ) + q 3 ( t ) k 3 ( t ) = k ( t ) , q ( t ) | k ( t ) | | q ( t ) | = ρ ( t ) 2 + u * ( t ) 2 | q ( t ) | .
But, ρ ( t ) 2 = x * ( t ) 2 ( α 1 f z * ( t ) y * ( t ) ) 2 2 x * ( t ) 2 ( α 2 f 2 z * ( t ) 2 + y * ( t ) 2 ) , because ( a b ) 2 2 ( a 2 + b 2 ) , for all a , b R . Hence,
q 1 ( t ) k 1 ( t ) + q 2 ( t ) k 2 ( t ) + q 3 ( t ) k 3 ( t ) C | q ( t ) | ,
with C = 2 m 2 ( α 2 f 2 z m a x 2 + y m a x 2 ) + u m a x 2 . Now, let us consider the expression between the second bracket of (22) and set N ( t ) = q 1 ( t ) b 1 ( t ) q ( t ) + q 2 ( t ) b 2 ( t ) q ( t ) + q 3 ( t ) b 3 ( t ) q ( t ) . Then,
N ( t ) = b ( t ) , q ( t ) q ( t ) | b ( t ) | | q ( t ) | 2 = | b 1 ( t ) | 2 + | b 2 ( t ) | 2 + | b 3 ( t ) | 2 | q ( t ) | 2 ,
with b ( t ) = ( b 1 ( t ) , b 2 ( t ) , b 3 ( t ) ) , that is,
N ( t ) ( α u * ( t ) ) 2 + u * ( t ) 2 + y * ( t ) 2 z * ( t ) 2 + ( α h ( t ) ) 2 + α 2 + ( h ( t ) u * ( t ) ) 2 1 2 | q ( t ) | 2 .
But, y * ( t ) 2 z * ( t ) 2 < y m a x 2 z m a x 2 and ( α u * ( t ) ) 2 2 α 2 + 2 u * ( t ) 2 2 α 2 + 2 u m a x 2 , and hence
( α h ( t ) ) 2 = ( ( y * ( t ) z * ( t ) + x * ( t ) z * ( t ) ) ( x * ( t ) y * ( t ) + d ) ) 2 4 y * ( t ) 2 z * ( t ) 2 + 4 x * ( t ) 2 z * ( t ) 2 + 4 x * ( t ) 2 y * ( t ) 2 + 4 α 2 4 y m a x 2 z m a x 2 + 4 m 2 z m a x 2 + 4 m 2 y m a x 2 + 4 α 2
and
( h ( t ) u * ( t ) ) 2 = ( y * ( t ) z * ( t ) + x * ( t ) z * ( t ) ) ( x * ( t ) y * ( t ) + u * ( t ) ) 2 4 y * ( t ) 2 z * ( t ) 2 + 4 x * ( t ) 2 z * ( t ) 2 + 4 x * ( t ) 2 y * ( t ) 2 + 4 u * ( t ) 2 4 y m a x 2 z m a x 2 + 4 m 2 z m a x 2 + 4 m 2 y m a x 2 + 4 u m a x 2 .
Substituting these inequalities into (25), we find
N ( t ) B | q ( t ) | 2 ,
with B = 7 α 2 + 7 u m a x 2 + 9 y m a x 2 z m a x 2 + 8 m 2 z m a x 2 + 8 m 2 y m a x 2 . Finally, we consider the expression between the first bracket of (22). Let V ( t ) = q 1 ( t ) q ( t ) M 1 ( t ) q ( t ) + q 2 ( t ) q ( t ) M 2 ( t ) q ( t ) + q 3 ( t ) q ( t ) M 3 ( t ) q ( t ) . Then,
V ( t ) | q 1 ( t ) | | M 1 ( t ) q ( t ) | | q ( t ) | + | q 2 ( t ) | | M 2 ( t ) q ( t ) | | q ( t ) | + | q 3 ( t ) | | M 3 ( t ) q ( t ) | | q ( t ) | .
We have | M 1 ( t ) q ( t ) | α 2 | q ( t ) | and | M 2 ( t ) q ( t ) | α | q ( t ) | , and the eigenvalues of the matrix M 3 ( t ) are
γ 1 ( t ) = 0 , γ 2 ( t ) = y * ( t ) z * ( t ) y * ( t ) 2 z * ( t ) 2 + α 2 2
and
γ 3 ( t ) = y * ( t ) z * ( t ) + y * ( t ) 2 z * ( t ) 2 + α 2 2 .
Consequently,
| q ( t ) M 3 ( t ) q ( t ) | γ 3 ( t ) | q ( t ) | 2
and
V ( t ) α 2 | q 1 ( t ) | . | q ( t ) | 2 + α | q 2 ( t ) | | q ( t ) | 2 + γ 3 ( t ) | q 3 ( t ) | | q ( t ) | 2 = s ( t ) , | q ( t ) | | q ( t ) | 2 , w i t h s ( t ) = α 2 , α , γ 3 ( t ) | s ( t ) | | q ( t ) | 3 = α 2 4 + α 2 + y * ( t ) z * ( t ) + y * ( t ) 2 z * ( t ) 2 + α 2 2 4 | q ( t ) | 3 ,
that is,
V ( t ) A | q ( t ) | 3 ,
with A = 7 α 2 4 + y m a x 2 z m a x 2 . By substituting all the previous relations in (22), we finally obtain the following differential inequality:
d d t | q ( t ) | A | q ( t ) | 2 + B | q ( t ) | + C .
Considering the quadratic equation
A K 2 B K + C = 0 ,
and its discriminant
Δ = 7 α 2 + 4 y m a x 2 z m a x 2 2 + 8 m 2 α 2 f 2 z m a x 2 + y m a x 2 + 4 u m a x 2 2 7 α 2 + 4 y m a x 2 z m a x 2 8 m 2 α 2 f 2 z m a x 2 + y m a x 2 + 4 u m a x 2 + 3 u m a x 2 + 5 y m a x 2 z m a x 2 + 8 m 2 z m a x 2 ( 1 α 2 f 2 ) ,
and the fact that 1 2 a 2 + 1 2 b 2 a b , for all a , b R , we have
Δ 7 α 2 2 + 5 u m a x 2 + 7 y m a x 2 z m a x 2 + 4 m 2 y m a x 2 + 4 m 2 z m a x 2 ( 2 α 2 f 2 ) .
But f < α ; thus,
Δ 7 α 2 2 + 5 u m a x 2 + 7 y m a x 2 z m a x 2 + 4 m 2 y m a x 2 + 4 m 2 z m a x 2 ( 2 α 2 f 2 ) > 0 .
Consequently, the discriminant of Equation (29) is positive. Let K 0 be the largest root of (29):
K 0 = B + B 2 4 A C 2 A .
For any vector q R 3 such that | q ( t ) | ρ , we introduce the function W such that W ( q ) = | q | + K 0 . Then,
d d t W ( q ( t ) ) = d d t | q ( t ) | A | q ( t ) | 2 + B | q ( t ) | + C = A W ( q ( t ) ) K 0 2 + B W ( q ( t ) ) K 0 + C ,
that is, for all t [ t 0 , t 1 ) ,
d d t W ( q ( t ) ) A W ( q ( t ) ) 2 ( 2 A K 0 B ) W ( q ( t ) ) .
But, K 0 = B + B 2 4 A C 2 A implies that 2 A K 0 = B + B 2 4 A C and 2 A K 0 > B .
Let ϕ ( . ) = W ( q ( . ) ) and consider the auxiliary Cauchy problem
ϕ ˙ ( t ) = A ϕ 2 ( t ) ( 2 A K 0 B ) ϕ ( t ) , t [ t 0 , t 1 ] ϕ ( t 0 ) = ϕ 0 , ϕ 0 ρ + K 0 .
We know that A > 0 , B > 0 , and C > 0 , so we have 0 < B 2 4 A C < B 2 , which implies that B 2 4 A C < B . This leads to A B + B 2 4 A C 2 A < B , and thus, A K 0 < B . In this case, we have 2 A K 0 B < A K 0 so 2 A K 0 B A < K 0 . Thus,
ϕ 0 ρ + K 0 > K 0 > 2 A K 0 B A .
By solving the Bernoulli equation associated with the Cauchy problem (31), we find that for all t [ t 0 , t 1 ] ,
ϕ ( t ) = A 2 A K 0 B + 1 ϕ 0 A 2 A K 0 B e ( 2 A K 0 B ) ( t t 0 ) 1 .
Let us assume that ρ and t 0 are such that the expression between brackets is defined for all t [ t 0 , t 1 ] . This can be achieved, for example, by choosing t 0 for a given ρ such that the difference ( t 1 t 0 ) is sufficiently small. From (32), the expression between brackets in (33) is negative; hence, ϕ ( . ) is a finite positive function that increases on [ t 0 , t 1 ] . Therefore, we have ϕ ( t ) < ϕ ( t 1 ) for all t [ t 0 , t 1 ) . Consequently, from the differential inequality (30), the Cauchy problem (31), Theorem 6.1 of Chapter 1 in [22], and
ϕ 0 = W ( q ( t 0 ) ) = | q ( t 0 ) | + K 0 ,
we get W ( q ( t ) ) ϕ ( t ) , which implies that | q ( t ) | + K 0 ϕ ( t ) , and thus, | q ( t ) | ϕ ( t ) K 0 < ϕ ( t 1 ) K 0 , t ( t 0 , t 1 ) , which is in contradiction with (21). Therefore, there exists a solution q ˜ ( t ) of (19) which is defined on the entire interval [ 0 , T ] . Thus, (18) is also defined on this interval.
Rewriting the system using the components of q ˜ ( t ) ,
r ^ ˙ ( t ) = ( u * ( t ) y * ( t ) z * ( t ) q 3 ˜ ( t ) ) r ^ ( t ) + y * ( t ) z * ( t ) v ^ ( t ) v ^ ˙ ( t ) = ( h ( t ) α q 2 ˜ ( t ) + y * ( t ) z * ( t ) q 3 ˜ ( t ) ) v ^ ( t ) + α μ ^ ( t ) μ ^ ˙ ( t ) = α ( 1 + q 2 ˜ ( t ) ) μ ^ ( t ) ,
in a third step and with (34), we show that the function r ^ ( t ) = L ( t ) has at most two distinct zeros. Let us assume that r ^ ( t ) has at least three distinct zeros τ 1 , τ 2 , τ 3 on [ 0 , T ] such that 0 < τ 1 < τ 2 < τ 3 < T . Applying the generalized Rolle’s theorem [23] to the first equation of (34), we conclude that the function v ^ ( t ) has at least two distinct zeros σ 1 , σ 2 on ( 0 , T ) such that 0 < σ 1 < σ 2 < T . Similarly, applying the generalized Rolle’s theorem to the second equation of (34), we obtain that the function μ ^ ( t ) has at least one zero ξ on ( 0 , T ) . But, according to the third equation of (34), μ ^ ( t ) = μ ^ 0 exp α 0 t ( α + q 2 ˜ ( s ) ) d s , and hence, μ ^ ( t ) = 0 everywhere on [ 0 , T ] . Returning to the second equation of (34), we find that v ^ ( . ) = 0 everywhere on [ 0 , T ] and the first equation of (34) leads to the same conclusion for the function r ^ ( . ) , that is, r ^ ( t ) = 0 , for all t [ 0 , T ] . This is in contradiction with Lemma 3. Consequently, the switching function L ( . ) has at most two distinct zeros on [ 0 , T ] . □
Proposition 5.
There exists θ [ 0 , T ) such that the optimal control u * ( . ) satisfies u * ( t ) = u m a x for all t ( θ , T ) .
Proof. 
This proposition is a consequence of the two previous ones. □
Remark 2.
From Propositions 4 and 5 and the initial conditions of System (12) and (14), we characterize the optimal control u * ( . ) . It can either be a constant function u * ( t ) = u m a x , for all t [ 0 , T ] , or a piecewise constant function such that
u * ( t ) = 0 if 0 t θ * , u m a x     if θ * < t T ,
where θ * [ 0 , T ) is the switching time.

2.2. Study of the Optimal Control Problem ( P ) ˜

By applying the Pontryagin maximum principle, we will characterize the optimal control u ˜ * associated with the optimal control problem ( P ) ˜ . For the control u ˜ * ( t ) and the corresponding solution X ˜ * ( t ) = x ˜ * ( t ) , y ˜ * ( t ) , z ˜ * ( t ) , there exists a non-trivial solution ψ ˜ * ( t ) = ψ ˜ 1 * ( t ) , ψ ˜ 2 * ( t ) , ψ ˜ 3 * ( t ) of the adjoint system
ψ ˜ ˙ 1 * ( t ) = u ˜ * ( t ) ψ ˜ 1 * ( t ) + y ˜ * ( t ) z ˜ * ( t ) ψ ˜ 1 * ( t ) + ψ ˜ 2 * ( t ) ψ ˜ 3 * ( t ) ψ ˜ ˙ 2 * ( t ) = x ˜ * ( t ) z ˜ * ( t ) ψ ˜ 1 * ( t ) + ψ ˜ 2 * ( t ) ψ ˜ 3 * ( t ) + 1 ψ ˜ ˙ 3 * ( t ) = x ˜ * ( t ) y ˜ * ( t ) ψ ˜ 1 * ( t ) + ψ ˜ 2 * ( t ) ψ ˜ 3 * ( t ) + α ψ ˜ 3 * ( t ) f ψ ˜ 2 * ( t ) ψ ˜ 1 * ( T ) = 0 , ψ ˜ 2 * ( T ) = 0 , ψ ˜ 3 * ( T ) = 0 ,
such that the control u ˜ * ( t ) maximizes the Hamiltonian H ˜ defined by
H ˜ x , y , z , ψ 1 , ψ 2 , ψ 3 , u ˜ = y + x y z + u ˜ ( m x ) ψ 1 + x y z + f z ψ 2 + x y z α z ψ 3 .
But, 0 u ˜ * ( t ) u ˜ m a x , for almost all t [ 0 , T ] , so
u ˜ * ( t ) = u ˜ m a x i f L ˜ ( t ) > 0 u ˜ * [ 0 , u ˜ m a x ] i f L ˜ ( t ) = 0 0 i f L ˜ ( t ) < 0 ,
where L ˜ ( t ) = ψ ˜ 1 * ( t ) is the switching function of problem ( P ) ˜ .
In order to study the behaviour of the switching function L ˜ ( . ) , we introduce the following auxiliary functions:
G ˜ ( t ) = ψ ˜ 1 * ( t ) + ψ ˜ 2 * ( t ) ψ ˜ 3 * ( t ) a n d P ˜ ( t ) = ψ ˜ 3 * ( t ) + α 1 f ψ ˜ 2 * ( t ) + α 1 .
Now, the adjoint System (36) for problem ( P ˜ ) can be rewritten as the following system of equations:
L ˜ ˙ ( t ) = u ˜ * ( t ) L ˜ ( t ) + y ˜ * ( t ) z ˜ * ( t ) G ˜ ( t ) G ˜ ˙ ( t ) = u ˜ * ( t ) L ˜ ( t ) + h ˜ ( t ) G ˜ ( t ) + α P ˜ ( t ) P ˜ ˙ ( t ) = ρ ˜ ( t ) G ˜ ( t ) + α P ˜ ( t ) + α 1 f 1 L ˜ ( T ) = 0 , G ˜ ( T ) = 0 , P ˜ ( T ) = α 1 ,
where ρ ˜ ( t ) = α 1 f x ˜ * ( t ) z ˜ * ( t ) x ˜ * ( t ) y ˜ * ( t ) and h ˜ ( t ) = y ˜ * ( t ) z ˜ * ( t ) + x ˜ * ( t ) z ˜ * ( t ) x ˜ * ( t ) y ˜ * ( t ) .
The analysis of the Cauchy problem (38) allows us to obtain the following propositions which give properties on the switching function L ˜ ( . ) .
Proposition 6.
The switching function L ˜ ( . ) is not zero on any finite subinterval of [ 0 , T ] .
Proof. 
This proof is exactly the same than the one for Proposition 3 using System (38) and the fact that f α . □
Remark 3.
From (37) and Proposition 6, it follows that the control u ˜ * ( . ) is a piecewise constant function:
u ˜ * ( t ) = u ˜ m a x   if L ˜ ( t ) > 0 , 0 if L ˜ ( t ) < 0 .
Proposition 7.
The switching function L ˜ ( . ) only takes positive values on [ 0 , T ) .
Proof. 
The proof for this lemma is carried out in several steps similarly to that for Proposition 4. In the first step, we perform a variable change to reduce the matrix of the non-autonomous linear System (38) to an upper triangular form:
r 1 ( t ) = L ˜ ( t ) , v 1 ( t ) = G ˜ ( t ) , μ 1 ( t ) = P ˜ ( t ) + g 1 ( t ) L ˜ ( t ) + g 2 ( t ) G ˜ ( t ) ,
where the functions g 1 ( t ) and g 2 ( t ) will be defined later. Using (38), we have
r ˙ 1 ( t ) = u ˜ * ( t ) r 1 ( t ) + y ˜ * ( t ) z ˜ * ( t ) v 1 ( t ) v ˙ 1 ( t ) = ( u ˜ * ( t ) α g 1 ( t ) ) r 1 ( t ) + ( h ˜ ( t ) α g 2 ( t ) ) v 1 ( t ) + α μ 1 ( t ) μ ˙ 1 ( t ) = g 1 ˙ ( t ) + ( u ˜ * ( t ) α ) g 1 ( t ) α g 1 ( t ) g 2 ( t ) + g 2 ( t ) u ˜ * ( t ) r 1 ( t ) + { g 2 ˙ ( t ) + ( h ˜ ( t ) α ) g 2 ( t ) α g 2 2 ( t ) + y ˜ * ( t ) z ˜ * ( t ) g 1 ( t ) + ρ ˜ ( t ) } v 1 ( t ) + α ( 1 + g 2 ( t ) ) μ 1 ( t ) + α 1 f 1 .
Choosing g 1 ( . ) and g 2 ( . ) such that the expressions between braces are zero, System (40) becomes
r ˙ 1 ( t ) = u ˜ * ( t ) r 1 ( t ) + y ˜ * ( t ) z ˜ * ( t ) v 1 ( t ) v ˙ 1 ( t ) = ( u ˜ * ( t ) α g 1 ( t ) ) r 1 ( t ) + ( h ˜ ( t ) α g 2 ( t ) ) v 1 ( t ) + α μ 1 ( t ) μ ˙ 1 ( t ) = α ( 1 + g 2 ( t ) ) μ 1 ( t ) + α 1 f 1 .
Then, we make the following substitutions:
r ^ 1 ( t ) = r 1 ( t ) , v ^ 1 ( t ) = v 1 ( t ) + g 3 ( t ) r 1 ( t ) , μ ^ 1 ( t ) = μ 1 ( t ) ,
where the function g 3 ( . ) will be determined later. System (41) is rewritten as follows:
r ^ ˙ 1 ( t ) = ( u ˜ * ( t ) y ˜ * ( t ) z ˜ * ( t ) g 3 ( t ) ) r ^ 1 ( t ) + y ˜ * ( t ) z ˜ * ( t ) v ^ 1 ( t ) v ^ ˙ 1 ( t ) = { g 3 ˙ ( t ) + ( u ˜ * ( t ) h ˜ ( t ) ) g 3 ( t ) y ˜ * ( t ) z ˜ * ( t ) g 3 2 ( t ) + α g 2 ( t ) g 3 ( t ) + u ˜ * ( t ) α g 1 ( t ) } r ^ 1 ( t ) + [ h ˜ ( t ) α q 2 ( t ) + y ˜ * ( t ) z ˜ * ( t ) g 3 ( t ) ] v ^ 1 ( t ) + α μ ^ 1 ( t ) μ ^ ˙ 1 ( t ) = α ( 1 + g 2 ( t ) ) μ ^ 1 ( t ) + α 1 f 1 .
We choose the function g 3 ( . ) such that the expression between braces is zero; thus, System (42) becomes
r ^ ˙ 1 ( t ) = ( u ˜ * ( t ) y ˜ * ( t ) z ˜ * ( t ) g 3 ( t ) ) r ^ 1 ( t ) + y ˜ * ( t ) z ˜ * ( t ) v ^ 1 ( t ) v ^ ˙ 1 ( t ) = ( h ˜ ( t ) α g 2 ( t ) + y ˜ * ( t ) z ˜ * ( t ) g 3 ( t ) ) v ^ 1 ( t ) + α μ ^ 1 ( t ) μ ^ ˙ 1 ( t ) = α ( 1 + g 2 ( t ) ) μ ^ 1 ( t ) + α 1 f 1 .
By definition of g 1 ( . ) , g 2 ( . ) , and g 3 ( . ) , we have the following non-autonomous system of quadratic differential equations:
g 1 ˙ ( t ) = ( α u ˜ * ( t ) ) g 1 ( t ) + α g 1 ( t ) g 2 ( t ) u ˜ * ( t ) g 2 ( t ) g 2 ˙ ( t ) = ( α h ˜ ( t ) ) g 2 ( t ) + α g 2 2 ( t ) y ˜ * ( t ) z ˜ * ( t ) g 1 ( t ) ρ ˜ ( t ) g 3 ˙ ( t ) = ( h ˜ ( t ) u ˜ * ( t ) ) g 3 ( t ) + y ˜ * ( t ) z ˜ * ( t ) g 3 2 ( t ) α g 2 ( t ) g 3 ( t ) + α g 1 ( t ) u ˜ * ( t ) .
As in the proof of Proposition 4, by adding the initial conditions g 1 ( 0 ) = g 1 0 , g 2 ( 0 ) = g 2 0 , g 3 ( 0 ) = g 3 0 to System (44), the corresponding solution g ( . ) = ( g 1 ( . ) , g 2 ( . ) , g 3 ( . ) ) is defined on the interval [ 0 , t m a x ) , which is the largest interval on which this solution exists, with either t m a x = + or t m a x < + . In the second step, we prove the existence of a solution g ( . ) to System (44) defined on the entire interval [ 0 , T ] .
The proof is similar to that for the existence of a solution to System (19) of Problem ( P ) in Proposition 4.
Solving the third equation of (43), we find that
μ ^ 1 ( t ) = exp α T t ( 1 + g 2 ( ϵ ) ) d ϵ × μ ^ 1 ( T ) + ( α 1 f 1 ) T t exp α T s ( 1 + g 2 ( ϵ ) ) d ϵ d s .
Since μ ^ 1 ( T ) = μ 1 ( T ) = P ˜ ( T ) + g 1 ( T ) L ˜ ( T ) + G ˜ ( T ) = α 1 , then
μ ^ 1 ( t ) = e α t T ( 1 g 2 ( ϵ ) ) d ϵ α 1 + ( 1 α 1 f ) t T e α T s ( 1 g 2 ( ϵ ) ) d ϵ d s .
Hence, μ ^ 1 ( t ) > 0 , for all t [ 0 , T ) . Now, the second equation of (43) gives
v ^ 1 ( t ) = exp T t h ˜ ( ϵ ) α g ˜ 2 ( ϵ ) + y ˜ * ( ϵ ) z ˜ * ( ϵ ) g ˜ 3 ( ϵ ) d ϵ × v ^ 1 ( T ) + α T t exp T s h ˜ ( ϵ ) α g ˜ 2 ( ϵ ) + y ˜ * ( ϵ ) z ˜ * ( ϵ ) g ˜ 3 ( ϵ ) d ϵ μ ^ 1 ( s ) d s .
Since v ^ 1 ( T ) = G ˜ ( T ) + g 3 ( T ) L ˜ ( T ) = 0 then
v ^ 1 ( t ) = α t T exp t s h ˜ ( ϵ ) α g ˜ 2 ( ϵ ) + y ˜ * ( ϵ ) z ˜ * ( ϵ ) g ˜ 3 ( ϵ ) d ϵ μ ^ 1 ( s ) d s .
Hence, v ^ 1 ( t ) < 0 , for all t [ 0 , T ) . Finally, with the first equation of (43), we get
r ^ 1 ( t ) = exp T t u ˜ * ( ϵ ) y ˜ * ( ϵ ) z ˜ * ( ϵ ) g ˜ 3 ( ϵ ) d ϵ × r ^ 1 ( T ) + T t exp T s u ˜ * ( ϵ ) y ˜ * ( ϵ ) z ˜ * ( ϵ ) g ˜ 3 ( ϵ ) d ϵ y ˜ * ( s ) z ˜ * ( s ) v ^ 1 ( s ) d s .
Since r ^ 1 ( T ) = r 1 ( T ) = L ˜ ( T ) = 0 ,
r ^ 1 ( t ) = t T exp t s u ˜ * ( ϵ ) y ˜ * ( ϵ ) z ˜ * ( ϵ ) g ˜ 3 ( ϵ ) d ϵ y ˜ * ( s ) z ˜ * ( s ) v ^ 1 ( s ) d s .
Hence, r ^ 1 ( t ) > 0 , for all t [ 0 , T ) , which implies that L ˜ ( t ) > 0 , for all t [ 0 , T ) . □
Remark 4.
According to Proposition 7 and (39), the optimal control u ˜ * ( t ) satisfies
u ˜ * ( t ) = u ˜ m a x , t [ 0 , T ] .

2.3. Numerical Simulations

We used MATLAB R2015a (8.5.0.197613) on a computer with an AMD RYZEN 7 processor at 3.9 GHz and 8 GB of RAM to make simulations.
For problem ( P ) , we considered α = 0.5000 , f = 0.0100 , m = 2 , and T = 50 , and the initial conditions were x 0 = 10 , y 0 = 30 , and z 0 = 0.9999 . These numerical values were obtained from [13], to which we simply added a value for f satisfying f < α . A global minimum has been obtained on [ 0 , T ] with θ * = 10 as well as the minimum value of the cost function y ( 50 ) = 0.0050016 (see Figure 1), which is compatible with our previous theoretical results (see Remark 2). Moreover, with the obtained optimal control, we can see that the concentration of pollutants significantly decreases.
Figure 1 illustrates the evolution of pollutants, bacteria, and oxygen concentrations with the optimal control u * ( . ) defined in (35). At the beginning of the reaction in the interval [ 0 , 10 ] , it can be seen that the oxygen concentration decreases due to its consumption by the bacteria. Indeed, due to the lack of oxygen and their low initial concentration, the bacteria fail to consume all the pollutants initially introduced in the reactor, resulting in their decrease. During this time interval, only about 33 % of the initially introduced pollutants are consumed by the bacteria. From t = 10 onwards, the oxygen concentration increases due to air pumping, and at this point, the bacteria concentration begins to increase quickly, while the pollutant concentration decreases significantly, and for sufficiently large t values, the pollutant concentration tends to zero.
For problem ( P ˜ ) , following Propositions 6 and 7, we are able to determine the type of optimal control. According to Remark 4, we have u ˜ * ( t ) = u ˜ m a x for all t [ 0 , T ] . Here, we consider α = 1 , f = 0.24 , m = 2 , and u m a x = 4 , and the initial conditions are x 0 = 12 , y 0 = 14 , z 0 = 0.9999 , and T = 2 .
Figure 2 illustrates the evolution of the concentrations of oxygen, pollutants, and bacteria in the reactor, as well as the outcome of minimizing the cost function 0 2 y ( t ) d t . It can be seen that at the beginning of the reaction, the oxygen concentration (in green) decreases quickly, which is due to its use by bacteria. Additionally, there is a point at which the oxygen concentration starts to increase, which is due to the decreased consumption by bacteria as they die from a lack of substrates. We can also remark that the concentration of pollutants (in red) decreases significantly, and for sufficiently large values of t, its trajectory tends towards zero. Furthermore, the concentration of bacteria (in blue) initially increases quickly but starts to decrease due to the reduction in the substrates (pollutants) needed for their metabolism.

3. Study of an Optimal Control Problem for a Wastewater Treatment Model with Two Types of Bacteria

In this section, we modify model (1) by considering two types of bacteria, mesophilic and thermophilic bacteria, as is the case in wastewater treatment [14]. We consider an optimal control problem in order to minimize the weighted sum of pollutant concentration at the final time and the costs of oxygen pumping operation.

3.1. Mathematical Model of the Aerobic Digestion Process

A mathematical model of this process can be formulated as a system of four ordinary differential equations:
x ˙ ( t ) = x ( t ) y ( t ) z ( t ) a x ( t ) y ( t ) w ( t ) b x ( t ) z ( t ) w ( t ) + U ( t ) ( m x ( t ) ) , y ˙ ( t ) = x ( t ) y ( t ) z ( t ) c x ( t ) y ( t ) w ( t ) + r z ( t ) + k w ( t ) λ y ( t ) , z ˙ ( t ) = x ( t ) y ( t ) z ( t ) α x ( t ) z ( t ) w ( t ) σ z ( t ) , w ˙ ( t ) = x ( t ) y ( t ) w ( t ) + e x ( t ) z ( t ) w ( t ) f w ( t ) , x ( 0 ) = x 0 ( 0 , m ) , y ( 0 ) = y 0 > 0 , z ( 0 ) = z 0 > 0 , w ( 0 ) = w 0 > 0 .
Here, x ( . ) is the concentration of oxygen, y ( . ) the concentration of organic matter (pollutants), z ( . ) the concentration of mesophilic aerobic bacteria, and w ( . ) the concentration of thermophilic aerobic bacteria. This model assumes that the reaction is described by the law of mass action.
System (47) is considered over a fixed time interval [ 0 , T ] , which corresponds to the duration of a single batch treatment.
The first equation of the system describes the evolution of oxygen concentration in the treated sludge: the first, second, and third terms describe its consumption in the reaction and the fourth term describes the input of oxygen (through pumping) into the reactor from the outside. Dissolved oxygen is replenished by pumping, which is subject to the saturation concentration m. Here, U ( . ) represents the oxygen pumping rate, which also serves as the control function for this model. The second equation describes the evolution of pollutant concentration, the first two terms describe their degradation by the two bacteria types and the third and fourth terms describe the production of pollutants due to the decomposition of mesophilic and thermophilic bacteria, of which a fraction of r and k is, respectively, recycled as substrates. Pollutants naturally degrade at a rate λ . The third equation describes the evolution of mesophilic aerobic bacteria; the first term defines their growth, the second term defines their reduction due to the growth of thermophilic bacteria, and the mesophilic bacteria also die naturally at a rate σ . Finally, the fourth equation describes the growth of thermophilic aerobic bacteria; the first term defines their growth by consuming organic pollutants, the second term defines their growth due to the reduction in mesophilic bacteria, and they also die naturally at a rate f. Moreover, a , b , c , α , e are positive rate constants of the mass action law and k , r , σ , f are positive real numbers. Consequently, according to the definition of all theses parameters, it is natural to consider that
k < f , r < σ , f < σ .
System (47) is a controlled system with the function U ( . ) as control. The set of corresponding admissible controls is composed of all Lebesgue measurable functions U ( . ) such that, for almost every t [ 0 , T ] ,
0 U ( t ) U max ,
where U max is the maximum aeration rate. For any U [ 0 , U max ] , we set u = U U max . The set of admissible controls for u is
U : = v : [ 0 , T ] [ 0 , 1 ] , v L e b e s g u e m e a s u r a b l e
and System (47) becomes
x ˙ ( t ) = x ( t ) y ( t ) z ( t ) a x ( t ) y ( t ) w ( t ) b x ( t ) z ( t ) w ( t ) + u ( t ) ( m x ( t ) ) , y ˙ ( t ) = x ( t ) y ( t ) z ( t ) c x ( t ) y ( t ) w ( t ) + r z ( t ) + k w ( t ) λ y ( t ) , z ˙ ( t ) = x ( t ) y ( t ) z ( t ) α x ( t ) z ( t ) w ( t ) σ z ( t ) , w ˙ ( t ) = x ( t ) y ( t ) w ( t ) + e x ( t ) z ( t ) w ( t ) f w ( t ) , x ( 0 ) = x 0 ( 0 , m ) , y ( 0 ) = y 0 > 0 , z ( 0 ) = z 0 > 0 , w ( 0 ) = w 0 > 0 .
We want to minimize the following objective function:
J ( u ) = β 0 T u 2 ( t ) d t + y ( T ) , β > 0
subject to the constraint of the dynamic associated with (51).
Proposition 8.
For all control u ( . ) U , all trajectories x ( . ) , y ( . ) , z ( . ) , and w ( . ) of (51) starting in the positive orthant are bounded and satisfy, for all t 0 ,
0 < x ( t ) < m , 0 < y ( t ) < y m a x , 0 < w ( t ) < w max , 0 < z ( t ) < z max ,
where
y m a x = y 0 + z 0 + k w m a x T , z max = x 0 + z 0 + m T , w max = a 1 ( x 0 + a w 0 + m T ) exp e m z m a x T .
Proof. 
The proof for this proposition is similar to that for Proposition 1. □
Proposition 9.
Problems (51) and (52) are well posed in the sense that for each control u U , there is a unique X = ( x , y , z , w ) solution to the Cauchy problem (51).
Proof. 
The proof for this proposition is similar to that for Proposition 2. □
Theorem 2.
Problems (51) and (52) admit an optimal control u * U such that the associated trajectory X * = ( x * , y * , z * , w * ) is a solution of (51).
Proof. 
It is a consequence of the two previous propositions and the fact that the right-hand side of the equations of the model and the term under the integral of the objective function are convex with respect to u. □

3.2. Pontryagin Maximum Principle

The aim of this section is to identify the necessary conditions of optimality for an optimal pair ( u * , ( x * , y * , z * , w * ) ) of problems (51) and (52). For this purpose, we apply the Pontryagin maximum principle [18].
Theorem 3.
Let u * be the optimal control and ( x * , y * , z * , w * ) the trajectory associated with problems (51) and (52). There is an absolutely continuous non-trivial solution ψ = ψ 1 , ψ 2 , ψ 3 , ψ 4 : [ 0 , T ] R 4 satisfying, for almost all t [ 0 , T ] ,
ψ ˙ 1 ( t ) = u * ( t ) ψ 1 ( t ) + y * ( t ) z * ( t ) ψ 1 ( t ) + ψ 2 ( t ) ψ 3 ( t ) + y * ( t ) w * ( t ) a ψ 1 ( t ) + c ψ 2 ( t ) ψ 4 ( t ) + z * ( t ) w * ( t ) b ψ 1 ( t ) + α ψ 3 ( t ) e ψ 4 ( t ) ψ ˙ 2 ( t ) = x * ( t ) z * ( t ) ψ 1 ( t ) + ψ 2 ( t ) ψ 3 ( t ) + x * ( t ) w * ( t ) a ψ 1 ( t ) + c ψ 2 ( t ) ψ 4 ( t ) λ ψ 2 ( t ) ψ ˙ 3 ( t ) = x * ( t ) y * ( t ) ψ 1 ( t ) + ψ 2 ( t ) ψ 3 ( t ) + x * ( t ) w * ( t ) ( b ψ 1 ( t ) + α ψ 3 ( t ) e ψ 4 ( t ) ) + σ ψ 3 ( t ) r ψ 2 ( t ) ψ ˙ 4 ( t ) = x * ( t ) y * ( t ) a ψ 1 ( t ) + c ψ 2 ( t ) ψ 4 ( t ) + x * ( t ) z * ( t ) ( b ψ 1 ( t ) + α ψ 3 ( t ) e ψ 4 ( t ) ) + f ψ 4 ( t ) k ψ 2 ( t ) ,
such that the control u * ( t ) maximizes the Hamiltonian H defined by
H t , X , ψ , u = β u 2 + u ( m x ) x y z a x y w b x z w ψ 1 + r z + k w x y z c x y w λ y ψ 2 + x y z α x z w σ z ψ 3 + x y w + e x z w f w ψ 4 .
Moreover, the transversality condition is given by
ψ ( T ) = ( ψ 1 ( T ) , ψ 2 ( T ) , ψ 3 ( T ) , ψ 4 ( T ) ) = ( 0 , 1 , 0 , 0 ) .
Noting that the Hamiltonian is concave with respect to u, a global maximum then exists and is achieved for u * such that
H u t , X * ( t ) . ψ ( t ) , u * ( t ) = 0 .
In this case, we get
u * ( t ) = ( m x * ( t ) ) ψ 1 ( t ) 2 β .
Since u * U , we conclude that, for all t [ 0 , T ] ,
u * ( t ) = min 1 , max 0 , ( m x * ( t ) ) ψ 1 ( t ) 2 β .

3.3. Numerical Simulations

For the simulations, we chose the following values for the parameters of (51):
e = 0.2100 , c = 0.1800 , a = 0.0130 , b = 0.0150 , α = 0.1400 , σ = 0.2400 ,
m = 2 , λ = 0.2000 , r = 0.00240 , γ = 0.0019 , f = 0.1900
We considered the weighting factor associated with the oxygen pumping cost as β = 0.21 and the initial values are x 0 = 10 , y 0 = 14 , z 0 = 4 , and w 0 = 2 .
Figure 3 illustrates the evolution of the concentrations of the different components of the system. Initially, we observe that the oxygen concentration (in green) decreases rapidly and reaches zero, then increases until the final time. The pollutant concentration (in red) decreases until the final time, and for a sufficiently large value of T, this concentration tends towards zero. The density of mesophilic bacteria (in blue) starts to increase and then decreases, reaching zero for a sufficiently large value of T. Additionally, we notice that the concentration of thermophilic bacteria (in pink) initially increases and then decreases until the final time, so that for large time values, the thermophilic bacteria concentration is minimal.
The second scheme of Figure 3 illustrates the control u * ( . ) . It starts at its minimum value of zero, increases to 0.35, and then begins to decrease slowly.

4. Concluding Remarks

In this work, we proposed two models for wastewater treatment using aerobic bacteria, in which mesophilic and thermophilic bacteria are used to degrade organic pollutants in the presence of oxygen. First, we proposed a wastewater treatment model using only thermophilic aerobic bacteria, and for this model, we studied two different optimal control problems where the control is the oxygen injection rate in the reactor. In the second part of this paper, we proposed another wastewater treatment model using two types of aerobic bacteria, mesophilic and thermophilic ones. We proposed an optimal control problem where the control remains the oxygen injection rate. The aim of this problem is to minimize the concentration of pollutants and reduce the costs associated with oxygen pumping. An optimal control has been found for each problem and our results have been illustrated with numerical simulations.
A direct continuation of this work is the consideration of a mathematical model with a finite number (more than two) of bacteria and its optimal control study to reduce the quantity of pollutants after wastewater treatment. Moreover, in this work, we made certain numerical value choices, leading us to highlight our theoretical study, but other choices are also possible. In particular, we are waiting for real data from fellow chemists to point out the efficiency of our study. Another perspective of this work involves the reduction in oxygenation costs by introducing algae in the water to provide the necessary oxygen to bacteria to remove pollutants.

Author Contributions

Conceptualization, S.B., E.G. and A.P.; methodology, S.B., E.G. and A.P.; software, E.G.; validation, S.B. and A.P.; formal analysis, S.B., E.G. and A.P.; investigation, S.B., E.G. and A.P.; writing—original draft preparation, E.G.; writing—review and editing, S.B. and A.P.; visualization, E.G.; supervision, S.B. and A.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to sincerely thank the anonymous referees for their careful reading of the manuscript, valuable suggestions, and remarks that enabled us to improve the presentation.

Conflicts of Interest

The authors declare that there are no conflicts of interests regarding the publication of this paper.

References

  1. Arora, A.; Saxena, S. Cultivation of azolla microphylla biomass on secondary-treated Delhi municipal effluents. Biomass Bioenergy 2005, 29, 60–64. [Google Scholar] [CrossRef]
  2. De-Bashan, E.; Bashan, Y. Immobilized microalgae for removing pollutants: Review of practical aspects. Bioresour. Technol. 2010, 101, 1611–1627. [Google Scholar] [CrossRef] [PubMed]
  3. Fu, F.; Wang, Q. Removal of heavy metal ions from wastewaters: A review. J. Environ. Manag. 2011, 92, 407–418. [Google Scholar] [CrossRef] [PubMed]
  4. Thompson, G.; Forster, C. Bulking in activated sludge plants treating paper mill wastewaters. Water Res. 2003, 37, 2636–2644. [Google Scholar] [CrossRef] [PubMed]
  5. Busby, J.B. Dynamic Modeling and Control Strategies for the Activated Sludge Process; Clemson University: Clemson, SC, USA, 1973. [Google Scholar]
  6. Gujer, W.; Henze, M.; Mino, T.; Matsuo, T.; Wentzel, M.; Marais, G. The activated sludge model no. 2: Biological phosphorus removal. Water Sci. Technol. 1995, 31, 1–11. [Google Scholar] [CrossRef]
  7. Gujer, W.; Henze, M.; Mino, T.; VanLoosdrecht, M. Activated sludge model no. 3. Water Sci. Technol. 1999, 39, 183–193. [Google Scholar] [CrossRef]
  8. Henze, M.; Grady, C.P.L., Jr.; Gujer, W.; Marais, G.V.R.; Matsuo, T. Activated Sludge Model No. 1.; IAWPRC Scientific and Technical Reports No. 1; IAWPRC: London, UK, 1987. [Google Scholar]
  9. Marsili-Libelli, S. Reduced-order modelling of the activated-sludge process. Ecol. Model. 1980, 9, 15–32. [Google Scholar] [CrossRef]
  10. Brune, D. Optimal control of the complete-mix activated sludge process. Environ. Technol. 1985, 6, 467–476. [Google Scholar] [CrossRef]
  11. Moreno, J. Optimal time control of bioreactors for the wastewater treatment. Optim. Control Appl. Methods 1999, 20, 145–164. [Google Scholar] [CrossRef]
  12. Tzoneva, R. Method for real time optimal control of the activated sludge process. In Proceedings of the 2007 Mediterranean Conference on Control & Automation, Athens, Greece, 27–29 June 2007; IEEE: New York, NY, USA, 2007; pp. 1–6. [Google Scholar]
  13. Grigorieva, E.V.; Bondarenko, N.V.; Khailov, E.N.; Korobeinikov, A. Analysis of optimal control problems for the process of wastewater biological treatment. Rev. Matemática Teoría Apl. 2013, 20, 103–118. [Google Scholar] [CrossRef]
  14. Rojas, J.; Burke, M.; Chapwanya, M.; Doherty, K.; Hewitt, I.; Korobeinikov, A.; Meere, M.; McCarthy, S.; O’Brien, M.; Tuoi, V.T.N.; et al. Modeling of autothermal thermophylic aerobic digestion. Math.-Ind. Case Stud. J. 2010, 2, 34–63. [Google Scholar]
  15. Krasnov, K.; Vorob’ev, N.; Godnev, I.; Vasil’eva, V.; Vasil’ev, V.; Kiseleva, V.; Belonogov, K.; Gostikin, V. Physical chemistry, vol. 2: Electrochemistry. In Chemical Kinetics and Catalysis; Vysshaya Shkola: Moscow, Russia, 1995. [Google Scholar]
  16. Izady, A.; Abdalla, O.; Sadeghi, M.; Majidi, M.; Karimi, A.; Chen, M. A novel approach to modeling wastewater evaporation based on dimensional analysis. Water Resour Manag. 2016, 30, 2801–2814. [Google Scholar] [CrossRef]
  17. Verma, M.; Brar, S.K.; Sreekrishnan, T.R.; Tyagi, R.D.; Surampalli, R.Y. Dimensionless groups as scale-up parameter for wastewater and wastewater sludge treatment in a stirred tank reactor. J. Residuals Sci. Technol. 2007, 4, 35–43. [Google Scholar]
  18. Pontryagin, L.; Boltyanskii, V.; Gamkrelidze, R.; Mishchenko, E. The maximum principle. In The Mathematical Theory of Optimal Processes; John Wiley and Sons: New York, NY, USA, 1962. [Google Scholar]
  19. Grigorieva, E.V.; Bondarenko, N.V.; Khailov, E.N.; Korobeinikov, A. Finite-dimensional methods for optimal control of autothermal thermophilic aerobic digestion. In Industrial Waste; InTech: Rijeka, Croatia, 2012; pp. 91–120. [Google Scholar]
  20. Baris, J.; Baris, P.; Ruchlewicz, B. On blow-up solutions of nonautonomous quadratic differential systems. Differ. Equ. 2006, 42, 320–326. [Google Scholar] [CrossRef]
  21. Baris, J.; Baris, P.; Ruchlewicz, B. Blow-up solutions of quadratic differential systems. J. Math. Sci. 2008, 149, 1369–1375. [Google Scholar] [CrossRef]
  22. Hale, J.K. Ordinary Differential Equations; Wiley Inscience Press: New York, NY, USA, 1969. [Google Scholar]
  23. Dmitruk, A. A generalized estimate of the number of zeros for solutions of a class of linear differential equations. SIAM J. Control Optim. 1992, 30, 1087–1091. [Google Scholar] [CrossRef]
Figure 1. Evolution of pollutants, bacteria, and oxygen concentrations (left) and the optimal control (right).
Figure 1. Evolution of pollutants, bacteria, and oxygen concentrations (left) and the optimal control (right).
Appliedmath 05 00073 g001
Figure 2. Evolution of the controlled system.
Figure 2. Evolution of the controlled system.
Appliedmath 05 00073 g002
Figure 3. Evolution of concentrations (left) and the optimal control (right).
Figure 3. Evolution of concentrations (left) and the optimal control (right).
Appliedmath 05 00073 g003
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Bernard, S.; Germain, E.; Piétrus, A. New Optimal Control Problems for Wastewater Treatment with Different Types of Bacteria. AppliedMath 2025, 5, 73. https://doi.org/10.3390/appliedmath5020073

AMA Style

Bernard S, Germain E, Piétrus A. New Optimal Control Problems for Wastewater Treatment with Different Types of Bacteria. AppliedMath. 2025; 5(2):73. https://doi.org/10.3390/appliedmath5020073

Chicago/Turabian Style

Bernard, Séverine, Estive Germain, and Alain Piétrus. 2025. "New Optimal Control Problems for Wastewater Treatment with Different Types of Bacteria" AppliedMath 5, no. 2: 73. https://doi.org/10.3390/appliedmath5020073

APA Style

Bernard, S., Germain, E., & Piétrus, A. (2025). New Optimal Control Problems for Wastewater Treatment with Different Types of Bacteria. AppliedMath, 5(2), 73. https://doi.org/10.3390/appliedmath5020073

Article Metrics

Back to TopTop