INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3006
www.rsisinternational.org
An Analytical Approach to Mixed-Constrained Quadratic Optimal
Control Problems
Ayodeji Sunday Afolabi
Department of Mathematical Sciences, Federal University of Technology, Akure
DOI:
https://dx.doi.org/10.51244/IJRSI.2025.1210000260
Received: 25 October 2025; Accepted: 02 November 2025; Published: 18 November 2025
ABSTRACT
This study investigates the analytical solution of quadratic optimal control problems (OCPs) constrained by
ordinary differential equations (ODEs) with real and coefficients. The formulation is based on the application of
first-order optimality conditions to the Hamiltonian function, which yield a coupled system of first-order
differential equations representing the necessary conditions for optimality. The resulting system is solved
analytically using the method of eigenvalue decomposition and state transformation to determine the optimal
state, control, and adjoint variables. The analytical procedure is illustrated through two examples of quadratic
OCPs, confirming the effectiveness and accuracy of the developed method in deriving exact optimal solutions.
INTRODUCTION
Optimization is the process of determining the best possible outcome under given conditions, either by
minimizing effort or maximizing desired benefits. It provides the mathematical foundation for decision-making
in engineering, science, and economics by expressing objectives as functions of decision variables. The
development of optimization theory has profoundly influenced control theory, operations research, and
computational mathematics. In particular, optimal control theory extends classical optimization to dynamical
systems, seeking control and state trajectories that minimize an objective function subject to system dynamics
and constraints. The growing demand for efficient computational strategies has led to the emergence of
numerical methods such as the penalty function, Lagrangian, and conjugate gradient approaches for solving
constrained optimization problems [13, 14].
Over the years, extensive studies have been carried out to develop efficient algorithms for constrained and
unconstrained optimization problems [5-9, 11, 15, 16]. Naidu [10] provided a rigorous foundation for optimal
control systems and discussed analytical and numerical techniques for solving such problems. [1] presented a
method for solving optimal control problems with mixed constraints by applying the first-order optimality
conditions derived from the Hamiltonian function. The resulting system of non-homogeneous first-order ODEs
was then solved using the fundamental matrix approach. Similarly, in [2], the analytical solutions of optimal
control problems governed by ODEs were investigated. The study employed the first-order optimality conditions
of the Hamiltonian function to derive and solve the associated system of first-order ODEs, leading to the
determination of the optimal state, control, and adjoint variables, as well as the optimal objective value.
Quadratic optimal control problems constrained by ODEs with real and vector-matrix coefficients were
considered. The analytical formulation is derived by applying first-order optimality conditions to the
Hamiltonian function, leading to a system of first-order ODEs solved using a state transformation approach. For
numerical implementation, the objective functional is discretized via Simpson’s one-third rule, while the system
dynamics are approximated using a fifth-order implicit integration scheme. The resulting discretized problem is
transformed into an unconstrained optimization model using the Augmented Lagrangian Method and solved
through the Conjugate Gradient Method (CGM) and FICO Xpress Mosel. Comparative analysis demonstrates
that FICO Xpress Mosel achieves faster convergence and higher numerical stability, particularly for large-scale
problems, highlighting its efficiency in solving complex quadratic OCPs [3, 12].
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3007
www.rsisinternational.org
The study focuses on a semi-analytical approach for solving a generalized quadratic optimal control problem
governed by ODEs. The analytical formulation is derived by applying the first-order optimality conditions to the
Hamiltonian function, which provide the necessary conditions for optimality. To solve the resulting general
Riccati differential equation, the Adomian Decomposition Method (ADM) is employed, representing the
nonlinear system as an infinite series that converges toward the exact solution. This procedure yields the optimal
state, control, and adjoint variables, from which the optimal value of the objective functional is determined. The
effectiveness of the proposed method is demonstrated through two illustrative examples of optimal control
problems constrained by ODEs [4].
METHODOLOGY
In this section, optimal control problems constrained by ODEs with mixed constraints and real co-efficients are
considered. The necessary conditions for this class of optimal control problems considered are derived. This
leads to the analytical solutions of the optimal control problems constrained by ODEs with mixed constraints
and real co-efficients.
In the framework of optimal control theory, we consider a control system aimed at finding an admissible control
󰇛󰇜 and its corresponding state trajectory 󰇛󰇜 that minimize a given cost functional. When only equality
restrictions are present, the problem can be formulated as
Minimize 󰇛󰇜
subjectto 󰇛󰇜0
(2.1)
where denotes the performance index and represents the set of equality constraints.
If inequality conditions are imposed, the optimal control problem is expressed as
Minimize 󰇛󰇜
subjectto 󰇛󰇜0
(2.2)
where is a vector function specifying the inequality restrictions that define the feasible region.
By combining (2.1) and (2.2), we obtain the general mixed-constrained optimal control problem:
Minimize 󰇛󰇜
subjectto 󰇛󰇜0
󰇛󰇜0
(2.3)
where


and . The components of and are given by
1
2
and
1
2
, respectively.
To handle the inequality constraints more conveniently, the mixed-constrained problem in (2.3) can be
transformed into an equality-constrained formulation by introducing a vector of nonnegative auxiliary variables
󰇛
1
2
󰇜. The equivalent problem becomes
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3008
www.rsisinternational.org
Minimize 󰇛󰇜
subjectto
󰇛󰇜012
󰇛󰇜
2
󰇛󰇜012
(2.4)
where the squared slack variables
2
convert inequalities into differentiable equalities while preserving
feasibility.
Necessary Conditions for a General Optimal Control Problems with Mixed Constraints
The general formulation of an optimal control problem involving both equality and inequality constraints can be
expressed as
Minimize󰇛󰇜
0
󰇛󰇜
subjectto󰇗󰇛󰇜 󰇛󰇜󰇛0󰇜
0
󰇛󰇜0󰇟0󰇠
(2.5)
where 󰇛󰇜
and 󰇛󰇜
. The functions 
,
, and 
are assumed to be continuously differentiable, and represents the terminal time of the process.
The Hamiltonian function associated with (2.5) is defined as
󰇛󰇜󰇛󰇜 󰇛󰇜 (2.6)
where
, and 󰇛󰇜
denotes the adjoint (or costate) variable.
To incorporate the inequality constraints into the formulation, the Lagrangian function is extended as
󰇛󰇜󰇛󰇜 󰇛󰇜 (2.7)
where 󰇛󰇜
is the Lagrange multiplier corresponding to the inequality constraint and satisfies the
complementary slackness conditions
0󰇛󰇜0 (2.8)
Applying the Euler–Lagrange principle to the Lagrangian in (2.7) gives



󰇡

󰇗
󰇢0(2.9)



󰇡


󰇗
󰇢0 (2.10)



󰇡

󰇗
󰇢0 (2.11)



󰇡

󰇗
󰇢0 (2.12)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3009
www.rsisinternational.org
Substituting (2.7) into (2.9)–(2.12) yields





󰇗
0 (2.13)





0 (2.14)






0 (2.15)






0 (2.16)
From these expressions, the necessary optimality conditions are obtained as
󰇗




(Adjoint Equation), (2.17)







(Optimality Condition), (2.18)
󰇗
󰇛
󰇜
󰇛

󰇜
 (State Equation), (2.19)






(Stationary Condition). (2.20)
Equations (2.17) and (2.19) form a system of first-order ODEs that can be solved simultaneously once suitable
boundary conditions are imposed. When only one boundary condition is specified, the remaining one is obtained
through the transversality (free-end) condition given by


󰇗
0orequivalently󰇛󰇜0 (Transversality Condition. (2.21)
For a solution to be optimal, all the necessary conditions defined in (2.17)–(2.21) must hold simultaneously. If
any of these are violated, the control and state trajectories are not optimal. The state and adjoint (costate)
equations are differential (dynamic) in nature, whereas the control equation is algebraic (static). Together, these
equations form a two-point boundary value problem: the state equation evolves forward in time, while the costate
equation evolves backward. Such problems often require iterative numerical procedures for their resolution,
which typically lead to open-loop optimal control laws.
Analytical Solution of Optimal Control Problems with Mixed Constraints and Real Co-efficients
Consider a quadratic optimal control problem governed by a linear state equation. The objective is to determine
the control 󰇛󰇜 and the corresponding state 󰇛󰇜 that minimize a performance index subject to both dynamical
and inequality constraints. The problem can be formulated as
Minimize󰇛󰇜
0
󰇛
2
󰇛󰇜
2
󰇛󰇜󰇜 (2.22)
subjectto󰇗󰇛󰇜󰇛󰇜 󰇛󰇜 (2.23)
󰇛󰇜 󰇛󰇜0󰇛0󰇜
0
(2.24)
where  are real parameters and 0 are positive weighting constants.
Theorem 2.1 Let
󰇛󰇜 denote the optimal control that minimizes 󰇛󰇜 in the admissible set , and let
󰇛󰇜
be the corresponding optimal state satisfying (2.23). Then there exists an adjoint variable 󰇛󰇜 that satisfies
󰇗󰇛󰇜2󰇛󰇜 󰇛󰇜 󰇟0󰇠 (2.25)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3010
www.rsisinternational.org
together with the transversality and optimality conditions
󰇛
󰇜
0 (2.26)
󰇛󰇜
󰇛󰇜
2
(2.27)
Proof. To derive the necessary conditions, we construct the augmented performance functional corresponding
to (2.22)–(2.24). The Hamiltonian is defined as
󰇛󰇜
2
󰇛󰇜 
2
󰇛󰇜󰇛󰇛󰇜 󰇛󰇜󰇜 (2.28)
while the Lagrangian incorporating the inequality constraint is given by
󰇛󰇜
2
󰇛󰇜 
2
󰇛󰇜󰇛󰇛󰇜 󰇛󰇜󰇜 󰇛󰇛󰇜 󰇛󰇜󰇜 (2.29)
Applying the Euler–Lagrange principle to , treated as a function of , yields the system

󰇡


󰇗
󰇢


(2.30)

󰇡


󰇗
󰇢


(2.31)

󰇡


󰇗
󰇢


(2.32)

󰇡


󰇗
󰇢


(2.33)
Solving (2.30)–(2.33) gives
󰇗󰇛󰇜2󰇛󰇜 󰇛󰇜  (2.34)
󰇛󰇜
󰇛󰇜
2
(2.35)
󰇗󰇛󰇜󰇛󰇜 󰇡
󰇛󰇜
2
󰇢 (2.36)
󰇛󰇜 󰇛󰇜0 (2.37)
Equations (2.34) and (2.36) form a coupled two-point boundary value problem that provides the necessary
conditions for optimality. In compact form, this system can be written as
󰇗󰇛󰇜
󰇗󰇛󰇜
2 
2
2
󰇛󰇜
󰇛󰇜
󰇧


2
󰇨 (2.38)
Let
2 
2
2
The eigenvalues of are obtained as
1
4
󰇛
2
44󰇜󰇛
2
44󰇜

2
4
(2.39)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3011
www.rsisinternational.org
2
4
󰇛
2
44󰇜󰇛
2
44󰇜

2
4
(2.40)
The corresponding eigenvectors are
1
4
2
󰇛4
󰇛
2
44󰇜󰇛
2
44󰇜

2
󰇜
4
1
(2.41)
2
4
2
󰇛4
󰇛
2
44󰇜󰇛
2
44󰇜
2
󰇜
4
1
(2.42)
Hence, the complementary solution of (2.38) is
󰇛󰇜
1

1
󰇍
󰇍
󰇍
1

2

2
󰇍
󰇍
󰇍
󰇍
2
(2.43)
Using the method of undetermined coefficients, we assume a particular solution of the form
󰇧
󰇛󰇜
󰇛󰇜
󰇨󰇡
󰇢 (2.44)
Substituting (2.44) into (2.38) gives
󰇡
0
0
󰇢
2 
2
2
󰇡
󰇢 󰇧


2
󰇨 (2.45)
Solving this linear system yields
󰇛
2
󰇜
2󰇛
2

2
󰇜
(2.46)
󰇛󰇜
2󰇛
2

2
󰇜
(2.47)
Therefore, the complete solution of (2.38) can be expressed as
󰇛󰇜
1

1
󰇍
󰇍
󰇍
󰇍
1

2

2
󰇍
󰇍
󰇍
󰇍
2
(2.48)
where 
1
and 
2
are constants of integration. Knowing the initial condition 󰇛0󰇜, one can determine 󰇛󰇜 to
satisfy the transversality condition. The constants 
1
and 
2
are then obtained by substituting these boundary
conditions into (2.48).
RESULTS AND DISCUSSIONS
Example 1
󰇛󰇜
0
󰇛
2
󰇛󰇜
2
󰇛󰇜󰇜 (3.1)
󰇗󰇛󰇜󰇛󰇜 󰇛0󰇜
0
(3.2)
󰇛󰇜0 0 (3.3)
Take 1 and
0
1.
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3012
www.rsisinternational.org
Solution 1 The Hamiltonian is given as
󰇛
2
󰇛󰇜
2
󰇛󰇜󰇜 󰇛󰇗󰇛󰇜 󰇛󰇜󰇜 (3.4)
Applying the necessary conditions for optimality

󰇟


󰇗
󰇠


(3.5)

󰇟

󰇗
󰇠


(3.6)

󰇟


󰇗
󰇠


(3.7)
Applying equations (3.5), (3.6) and (3.6) on equation (3.4), we have
󰇗 2 (3.8)
2 (3.9)
󰇗 (3.10)
From Equation (3.9)
2
(3.11)
In view of equation (3.11), equation (3.10) becomes
󰇗󰇛󰇜
2
(3.12)
Next, we solve for x and using matrix method
󰇗
󰇗
󰇩
0
1
2
2 0
󰇪
(3.13)
Let 󰇩
0
1
2
2 0
󰇪, the eigenvalues using the characteristics equation 0 are 1.
When 1, we obtain the eigenvectors
󰇩
1
1
2
2 1
󰇪󰇣
󰇤󰇣
0
0
󰇤 (3.14)

1
2
0 (3.15)
2 0 (3.16)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3013
www.rsisinternational.org
This implies that when 12.
When 1,
󰇩
1
1
2
2 1
󰇪󰇣
󰇤󰇣
0
0
󰇤 (3.17)
1
2
0 (3.18)
2 0 (3.19)
When 12.
Therefore, the general solution of 3.13 is given as
󰇛󰇜
1
1
󰇍
󰇍
󰇍
󰇍
1

2
2
󰇍
󰇍
󰇍
󰇍
2
(3.20)
where 
1
and 
2
are constants of integration and
1
󰇍
󰇍
󰇍
󰇍
and
2
󰇍
󰇍
󰇍
󰇍
represent the eigenvectors of . Since we know
󰇛0󰇜, the task is to choose 󰇛󰇜 so that the transversality condition is satisfied. Hence,
󰇛󰇜
1

2

(3.21)
󰇛󰇜2
1
2
2

(3.22)
Applying the initial conditions 󰇛0󰇜1 and 󰇛0󰇜1, we have
󰇛0󰇜
1

2
1 (3.23)
󰇛1󰇜2
1
1
2
2
1
0 (3.24)
Solving (3.23) and (3.24) simultaneously, we obtain the values for 
2
2
and 
2
1
2
1
Hence,
󰇛󰇜
2


2
1
(3.25)
and
󰇛󰇜
2󰇛
2


󰇜
2
1
(3.26)
Recall from equation (3.11) that
2
. Hence,
󰇛󰇜
2


2
1
(3.27)
Substituting
󰇛󰇜 and
󰇛󰇜 into 󰇛󰇜
1
0
󰇛
2
󰇛󰇜
2
󰇛󰇜󰇜 , and solving the resulting integral, we
obtain an optimal value for 󰇛󰇜
󰇛󰇜
1
0
󰇛
2


2
1
󰇜
2
󰇛
2


2
1
󰇜
2
 (3.28)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3014
www.rsisinternational.org
󰇛󰇜
1
0
2󰇛
24

2
󰇜
󰇛
2
1󰇜
2
 (3.29)
󰇛󰇜
2
󰇛
2
1󰇜
2
1
0
󰇛
24
2
󰇜 (3.30)
󰇛󰇜
2
󰇛
2
1󰇜
2
󰇟
24
2
2
2
󰇜󰇠󰇛0 1󰇜 (3.31)
Applying the lower and upper limits, we have,
󰇛󰇜
2
󰇛
2
1󰇜
2
󰇟󰇛
2
2
2
2
󰇜 󰇛
4
2
0
2
󰇜󰇠 (3.32)
󰇛󰇜
2
󰇛
2
1󰇜
2
󰇟04908421806󰇠 (3.33)
󰇛󰇜
09816843611
1288986205
0761594156 (3.34)
Example 2
󰇛󰇜󰇛󰇜
0
󰇛󰇛󰇜󰇜
2
 (3.35)
󰇗 󰇛󰇜 󰇛󰇜 󰇛0󰇜
0
(3.36)
󰇛󰇜0 0 (3.37)
Solution 2 The Hamiltonian is given as
2
󰇛󰇜󰇛󰇗󰇛󰇜 󰇛󰇜󰇛󰇜 (3.38)
Thus, the E-L system can be written as

󰇟


󰇗
󰇠


(3.39)

󰇟

󰇗
󰇠


(3.40)

󰇟


󰇗
󰇠


(3.41)
Applying equations (3.39), (3.40) and (3.41) on equation (3.38), we have
󰇗󰇛󰇜󰇛󰇜 (3.42)
2󰇛󰇜 󰇛󰇜0 (3.43)
󰇛󰇜
󰇛󰇜
2
(3.44)
󰇗󰇛󰇜󰇛󰇜 󰇛󰇜 (3.45)
This implies that
󰇗󰇛󰇜󰇛󰇜
󰇛󰇜
2
(3.46)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3015
www.rsisinternational.org
󰇗󰇛󰇜󰇛󰇜 (3.47)
The general solution of the first order ordinary differential equation given by equation (3.42) is
󰇛󰇜

(3.48)
From the transversality condition
󰇛󰇜
󰇛󰇜󰇛󰇜
󰇛󰇜
1 (3.49)
󰇛󰇜

1 (3.50)
1


(3.51)
Hence
󰇛󰇜
󰇛󰇜
(3.52)
Since
󰇛󰇜
󰇛󰇜
2
, it implies that
󰇛󰇜
󰇛󰇜
2
(3.53)
In view of equation (3.53), equation (3.45) now implies that
󰇗󰇛󰇜󰇛󰇜
󰇛󰇜
2
(3.54)
󰇗 󰇛󰇜
󰇛󰇜
2
(3.55)
Using the integrating factor

to solve equation (3.55), we have

1
2
󰇛2󰇜
 (3.56)
󰇛󰇜
1
4



(3.57)
Applying the initial condition 󰇛0󰇜
0
, we obtain the value of the constant of integration  as follows
󰇛󰇜
1
4
󰇛0󰇜

󰇛0󰇜
0
(3.58)

0
1
4

(3.59)
This implies that
󰇛󰇜
1
4

0

1
4

(3.60)
󰇛󰇜
0

1
4

󰇛


󰇜 (3.61)
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3016
www.rsisinternational.org
Recall from equation (3.35) that
󰇛󰇜󰇛󰇜
0
󰇛󰇛󰇜󰇜
2
 (3.62)
This implies that
󰇛󰇜󰇛󰇜
0
󰇛

󰇛󰇜
2
󰇜
2
 (3.63)
󰇛󰇜
1
4
0
2󰇛󰇜
 (3.64)
󰇛󰇜 󰇟
1
8
2󰇛󰇜
󰇠
0
(3.65)
󰇛󰇜
1
8
󰇛
2󰇛󰇜
󰇛
2󰇛0󰇜
󰇜󰇜 (3.66)
󰇛󰇜
1
8
󰇛
2
1󰇜 (3.67)
CONCLUSION
This research has presented an analytical framework for solving continuous quadratic optimal control problems
governed by ODEs with mixed constraints and real coefficients. The application of first-order optimality
conditions to the Hamiltonian function provided the necessary equations for optimality, which were solved
analytically to obtain the optimal state, control, and adjoint variables. The analytical approach developed in this
study offers a rigorous and computationally effective tool for addressing a broad class of optimal control
problems encountered in engineering and applied sciences.
REFERENCES
1. Afolabi, A.S. and Olotu, O. (2020), Analytical Solutions of Optimal Control Problems with Mixed
Constraints. Iconic Research and Engineering Journals, 3(12), 1–9, India.
2. Afolabi, A.S. (2022), On the Constrained Optimal Control Problems with Mixed Constraints.
International Journal of Mathematical Analysis and Modelling, 5(2), 25–35, India.
3. Afolabi, A.S. and Oyewale, A.A. (2025), On the Solutions of Optimal Control Problems Constrained by
Ordinary Differential Equations with Vector-Matrix Coefficients Using FICO Xpress Mosel. Journal of
Mathematical Sciences and Optimization: Theory and Application, 11(2), 111–132, Nigeria.
4. Crankson, M.V., Afolabi, A.S. and Eshun, S. (2023), Comprehensive Semi-Analytical Approach to
Quadratic Optimal Control Problems Governed by Ordinary Differential Equations. International Journal
of Science and Research, 7(942), 2319–7064, India.
5. Fiacco, A. V. and McCormick, G. P. (1968). Nonlinear Programming: Sequential Unconstrained
Minimization Techniques. Wiley, New York.
6. Izmailov, A.F., Solodov, M.V. and Uskov, E.I. (2012), Global Convergence of Augmented Lagrangian
Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with
Complementarity Constraints. SIAM Journal on Optimization, 22(4), 1579–1606.
7. Kahuru, J., Luboobi, L.S. and Gyekye, Y.N. (2017), Optimal Control Techniques on a Mathematical
Model for the Dynamics of Tungiasis in a Community. International Journal of Mathematics and
Mathematical Sciences, 2017, Article ID 4804897, 1–19.
8. Lasdon, L.S., Mitter, S.K. and Warren, A.D. (1967), The Conjugate Gradient Method for Optimal
Control Problems. IEEE Transactions on Automatic Control, 12(2), 132–138.
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
Page 3017
www.rsisinternational.org
9. Li, C. and Can, D. (2009). “Global Convergence of Conjugate Gradient Methods.” Applied Mathematics
and Computation, 210(2), 444–452.
10. Naidu, D. S. (2002). Optimal Control Systems. CRC Press.
11. Orji, J.C., Miswanto, and Afolabi, A.S. (2024), Optimal Control Problems Constrained by Ordinary
Differential Equations Using Conjugate Gradient Method and FICO Xpress Mosel. International
Research and Innovation Journal, 1(1), 134–149, UK.
12. Oyewale, A.A., Afolabi, A.S. and Dawodu, K.A. (2024), On the Optimal Control Problems Constrained
by Ordinary Differential Equations Using Conjugate Gradient Method and FICO Xpress Mosel. Journal
of Mathematics and Computational Science, 14(18), 1–25, UK.
13. Polak, E. (1973), An Historical Survey of Computational Methods in Optimal Control. SIAM Review,
15(2), 552–584.
14. Rao, S.S. (2019), Engineering Optimization: Theory and Practice, 5th Edition. John Wiley and Sons,
Hoboken, NJ, USA.
15. Sofia, H. (2014), Optimal Control and Numerical Optimization Applied to Epidemiological Models.
Ph.D. Thesis, Department of Mathematics, University of Aveiro, pp. 1–111.
16. Zboon, R.A., Yadav, S.P. and Mohan, C. (1999), Penalty Method for an Optimal Control Problem with
Equality and Inequality Constraints. Indian Journal of Pure and Applied Mathematics, 30(1), 1–14.