
INTERNATIONAL JOURNAL OF RESEARCH AND SCIENTIFIC INNOVATION (IJRSI)
ISSN No. 2321-2705 | DOI: 10.51584/IJRSI | Volume X Issue X October 2025
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].