1. Introduction
In the research paper [
1], Hanson applied the duality theory from mathematical programming to a new class of functions named invex functions. In this regard, Craven and Glover [
2] established that invex functions are characterized as functions where the stationary/critical points become global minima. As a generalization of the work of Mond and Hanson [
3], Mond and Smart [
4] formulated some sufficiency and duality results in scalar variational control problems. Also, duality theorems have been stated for linear fractional variational problems by Aggarwal et al. [
5]. Mukherjee and Rao [
6] presented mixed dual problems associated with multiobjective variational problems and established dualities under
-invexity hypotheses. Historically, multiobjective variational problems governed by equality and inequality restrictions have been of great importance and interest (including conditions of optimality, dual problems, and various areas of applicability), and we have only failed to consider the following researchers: Zhian and Qingkai [
7], Zalmai [
8], Mititelu [
9], Hachimi and Aghezzaf [
10], Chen [
11], Kim and Kim [
12], and Nahak and Nanda [
13]. Gulati et al. [
14] studied optimality conditions and the associated duality for a class of multiobjective control problems. Arana-Jiménez et al. [
15] investigated a necessary and sufficient condition for duality in some multiobjective variational problems. Khazafi et al. [
16] discussed sufficiency and duality for multiobjective control problems under generalized
-type I functions. Zhang et al. [
17] analyzed the sufficiency and duality for multiobjective variational control problems under
G-invexity assumptions.
Recently, Das et al. [
18] provided sufficient KKT-type second-order optimality conditions for a class of set-valued fractional minimax problems. Under contingent epi-derivative and generalized second-order cone convexity hypotheses, the authors formulated some duals for the considered problem. Khan and Al-Solamy [
19] discussed, for a non-differentiable minimax fractional programming problem, the optimality condition for an optimal solution and a dual model. Mititelu and Treanţă [
20] formulated some efficiency conditions in vector control problems generated by multiple integrals. Sharma [
21] presented a higher-order duality for variational control problems. Oliveira and Silva [
22] studied sufficient optimality conditions for some multiobjective control problems. In the last decade, Treanţă [
23] and his collaborators investigated some classes of multi-dimensional multiobjective variational control problems. In this direction, Treanţă and Mititelu [
24] formulated duality results in multi-dimensional vector fractional control problems by considering
-quasiinvexity assumptions.
Most optimization problems that occur in practice have several objective functions that must be optimized simultaneously. This type of problem, of considerable interest, includes various branches of mathematical sciences, design engineering, and game theory. Because of the increasing complexity of the environment, the initial data often suffer from inaccuracy. For example, in the modeling of many processes in industry and economy in order to make decisions, it is not always possible to have complete information about the parameters and variables involved. Therefore, an adequate uncertainty framework is necessary to formulate the model, and new methods have to be adapted or developed to provide optimal or efficient solutions in a certain sense. In order to tackle the uncertainty in an optimization problem, robust and interval-valued optimization represents some growing branches of applied mathematics and may provide an alternative choice for considering the uncertainty. Over time, several researchers and mathematicians have been interested to obtain many solution procedures in interval analysis and robust control. In order to formulate necessary and sufficient optimality conditions and duality theorems for different types of robust and interval-valued variational problems, various approaches have been proposed.
In this paper, under the motivation of the above-mentioned research papers and by considering suitable convexity hypotheses for the involved integral-like functionals, a mixed-type dual model is developed for the multiple objective fractional optimal control problem determined by multiple integral functionals defined in Ritu et al. [
25]. More specifically, this paper is essentially a natural continuation of the studies stated in Mititelu and Treanţă [
20] and Ritu et al. [
25]. In this regard, by using the robust necessary efficiency conditions established in Ritu et al. [
25], we investigate robust weak, robust strong, and robust strict converse-type duality results. The limitations of the existing works and the main credits of this paper are the following: (i) the presence of mixed constraints involving partial derivatives, (ii) the presence of the uncertainty data both in the cost functionals but also in the constraint functionals, and (iii) the combination of parametric and robust approaches to study the considered class of problems.
2. Preliminaries
Let us start with the standard Euclidean spaces , and , and a compact set in , denoted by S. Define the multi-time variable , such that t . Also, consider the space (denoted by A) of state functions with continuous first-order partial derivatives as and consider the continuous control functions in the space B as . Additionally, we use the abbreviations: , . Next, we formulate the rules that are considered for any two points :
- (i)
- (ii)
- (iii)
- (iv)
The robust multiple objective fractional optimal control problem is formulated (see, also, Mititelu and Treanţă [
20], Treanţă and Mititelu [
24], and Ritu et al. [
25]) as:
where
are
-class functionals (almost everywhere); the jet bundle of first-order associated with
S and
is stated as
; also, we assume
, and
, and
represent the uncertainty parameters of the compact convex sets
, and
.
The robust counterpart for
is introduced as follows:
The feasible solution set of
, known as the robust feasible solution set for
, is denoted as follows:
Next, we consider the following parametric scalar optimal control problem corresponding to
as follows:
The robust counterpart associated to
is given by:
Definition 1. A feasible pair is named as a robust weak optimal solution for if:for all feasible pairs . Definition 2. A feasible pair is named a robust optimal solution in iffor all feasible pairs . Definition 3. A vector functional is said to be convex at if the inequalityholds for all Definition 4. A feasible pair is named a robust weak efficient solution for if there does not exist fulfilling Definition 5. A feasible pair is named a robust efficient solution for if does not exist satisfying Theorem 1 ([
25] Robust necessary efficiency conditions for
)
. Let be a robust weak efficient solution to the considered robust multiple objective fractional optimal control problem and . Then, the scalars , the piecewise differentiable functions , and the parameters of uncertainty , exist, fulfillingfor all , excepting the discontinuity points. 3. Main Results: Mixed Robust Duality
In this section, by using the robust necessary efficiency conditions established in Ritu et al. [
25], we investigate robust weak, robust strong, and robust strict converse-type duality results. More precisely, by considering the Wolfe- and Mond–Weir-type dualities, we formulate a robust mixed-type dual problem, and, under suitable convexity assumptions of the involved functionals, we establish some equivalence results between the solution sets of the considered models. The methodology used is based on several techniques from the calculus of variations, the Lagrange-Hamilton theory, and the distribution and control theory, which are appropriate in the study of the considered robust variational control problems. To the best of the authors’ knowledge, the robust duality results for such types of problems are new in the specialized literature.
Further, by denoting
, we associate a Wolfe-type robust dual model for
, as follows:
The corresponding robust counterpart for
is formulated as:
for
,
,
.
We denote = satisfying conditions to be the feasible solution set to , and we name it as the robust feasible solution set to .
Definition 6. A feasible point is considered to be the robust weak efficient solution to , if there does not exist satisfyingwhere . The Mond–Weir robust dual model (see Mond and Weir [
26]) associated with
, considering data uncertainty in both the objective and constraint functionals, is given as follows:
The corresponding robust counterpart for
is stated as:
for
,
,
.
We denote = fulfilling to be the feasible solution set to , and we call it the robust feasible solution set to .
Definition 7. A feasible point is named a robust weak efficient solution to if does not exist satisfying Next, we associate a mixed robust dual model for
, as follows:
The corresponding robust counterpart for
is stated as:
for
,
,
.
We denote = satisfying conditions to be the feasible solution set to , and we call it as the robust feasible solution set to .
Definition 8. A feasible point is named as a robust weak efficient solution to , if there does not exist fulfilling In the following, we establish a robust weak-type duality theorem for .
Theorem 2 (Robust weak duality theorem)
. Let and be the robust feasible solutions of and , respectively. Assume that and . Further, if , and are convex at , then the following inequality cannot hold: Proof. Assume on the contrary that
is fulfilled. Since
, we obtain
is satisfied. As
is the robust feasible solution to the problem
, it implies
By considering that
and
, therefore, the above inequality can be written as
Since
,
and
are convex at
, we have
and
Adding the inequalities (18)–(20) and using the dual constraints for the dual feasible solution
, we obtain
which is a contradiction to the inequality
. This completes the proof. □
In the following, we establish a robust strong-type duality theorem for .
Theorem 3 (Robust strong duality theorem). Let be a robust weak efficient solution to . Consider that and the constraint qualification conditions hold for . Then, , exist as the piecewise smooth functions, and , , as the parameters of uncertainty such that is a robust feasible solution to . Moreover, if Theorem holds, then is a robust weak efficient solution to .
Proof. As
is a robust weak efficient solution to
, therefore, by Theorem 1,
,
exist as the piecewise differentiable functions and
,
,
as the parameters of uncertainty, such that the conditions
hold at
. Hence,
is a robust feasible solution to
and the corresponding objective function values are equal. Suppose conditions
hold at
and
is not a weak efficient solution to
. Thus,
exists satisfying
From Theorem 1, we obtain
Since
, we have
which is a contradiction to Theorem
. Hence,
is a robust weak efficient solution in
. □
Next, we establish a robust strict converse-type duality result for .
Theorem 4 (Robust strict converse duality theorem)
. Let be a robust feasible solution in . Consider that and , and are strictly convex at . If such thatthen, is a robust weak efficient solution in . Proof. As
is a robust feasible solution in
, on multiplying the inequality
and
by
and
, respectively, and then integrating, we obtain
Now, we assume on the contrary that
is not a robust weak efficient solution in
. Consequently,
exists such that
or, equivalently,
By considering the hypothesis,
therefore, the above inequality yields
Since
, therefore
By using the strict convexity property of
at
, we have
which, together with the inequality
and feasibility of
, gives
Again, by the strict convexity property of
at
, we have
Also, as
and
are robust feasible solutions in
and
, respectively, we obtain
which, together with inequality
, results in
Similarly, since
is also strictly convex function, we obtain
On adding the inequalities
, we obtain the following inequality:
which contradicts the inequality
. This completes the proof. □
Remark 1. (i) In order to justify the main results derived in the paper, some illustrative applications and numerical simulations can be consulted by the reader in the recent research work of Jayswal et al. [27]. (ii) Regarding the future research directions associated with this paper, we could mention the study of the case where the second-order partial derivatives are presented, as well as the situation when the involved functionals are not necessarily (strictly) convex.