Abstract
In this paper, we establish various results of duality for a new class of constrained robust nonlinear optimization problems. For this new class of problems, involving functionals of (path-independent) curvilinear integral type and mixed constraints governed by partial derivatives of second order and uncertain data, we formulate and study Wolfe, Mond-Weir and mixed type robust dual optimization problems. In this regard, by considering the concept of convex curvilinear integral vector functional, determined by controlled second-order Lagrangians including uncertain data, and the notion of robust weak efficient solution associated with the considered problem, we create a new mathematical context to state and prove the duality theorems. Furthermore, an illustrative application is presented.
Keywords:
multi-objective robust control problem; robust duality; uncertain data; robust feasible solution; robust weak efficient solution MSC:
65K10; 26B25
1. Introduction
Over time, from the desire to model several processes in science, nature or engineering, many researchers (for instance, the reader is directed to the works of Trélat and Zuazua [], Mititelu and Treanţă [], Treanţă [], Jayswal and Preeti []) paid a particular attention in the study of certain ordinary differential equation, partial differential equation, partial differential inequation, or isoperimetric-type constrained optimization problems. As is well known, the (necessary and sufficient) optimality or efficiency conditions and the associated dual problems are essential in optimization theory. By using the duality theory, we can better understand the nature of the original (primal) problem from the perspective of a dual problem. In this regard, we make a dihonesty by mentioning only the notable works of Wolfe [], Weir and Mond [], Mishra et al. [], Pham [], Gao [], Treanţă and Mititelu [], Tung [], Treanţă [,] and the references cited therein. To investigate some complex real-life phenomena or processes involving uncertain initial data, many researchers used several elements coming from interval analysis and robust control. In this respect, the reader can consult the following research papers of Jeyakumar et al. [], Wei et al. [], Liu and Yuan [], Sun et al. [], Du et al. [], Treanţă [], Lu et al. [], Wang et al. []. For other different but connected ideas on this topic (robust control), the reader can consult Liu et al. [,,]. Despite all the previous research works, our study has not been approached until now and we will present its totally novel elements in the following.
In this paper, motivated and inspired by the above mentioned papers, we introduce and study a new class of constrained robust nonlinear control problems, denoted by . For the new class of robust optimization problems involving curvilinear integral functionals (which are independent of the path), equality and inequality constraints including partial derivatives of second order and uncertain data, we formulate and investigate various robust dual optimization problems. To this aim, first we introduce the concept of convex curvilinear integral vector functional that is determined by controlled second-order Lagrangians with uncertain data. Then, by considering the notion of robust weak efficient solution associated with the problem , we formulate Wolfe, Mond-Weir and mixed type dual optimization results. Compared to other works published so far, the fundamental merits of this paper are the following: (i) by using closed controlled second-order Lagrange 1-forms with uncertain data, we introduce the notion of convexity for curvilinear integral-type vector functionals; (ii) construction of a mathematical setting determined by curvilinear integral-type vector functionals (containing partial derivatives of second order and uncertainty parameters) and infinite dimensional function spaces. These elements are completely new in the robust nonlinear optimization field. Furthermore, taking into account the physical importance (for instance, mechanical work) of the curvilinear integrals, the techniques developed in this paper can give rise to new ideas in many other research areas with applications in nature and engineering.
In the next section (see Section 2), we formulate the robust nonlinear optimization problem we intend to investigate, and some preliminary elements. Section 3 introduces Wolfe type robust dual optimization problem associated with the considered multi-objective robust nonliunear optimization problem . Robust weak, strong and strict converse duality results are provided here. Next, in Section 4, we formulate and study the Mond-Weir type robust dual optimization problem. Section 5 includes and characterizes the mixed type robust dual optimization problem. Furthermore, an illustrative real-life application is included here in order to validate the theoretical elements derived in the paper. The conclusions and a further research line of this paper are formulated in Section 6.
2. Problem Description
In this paper, we are considering the following notations and working hypotheses as in Treanţă and Das [], and Treanţă [,]:
- •
- consider and as Euclidean spaces, having the dimensions and n, respectively;
- •
- K is a compact set in , , and is a smooth curve that joins and in K;
- •
- consider is the space of state functions , belonging to (almost averywhere) -class, and the notations ;
- •
- denote by the space of all measurable control functions ;
- •
- T denotes the transpose of a vector;
- •
- consider the notations: ;
- •
- for two vectors , we use the following convention for inequalities and equalities:
- (i)
- ()
- ()
- ()
The second-order PDE&PDI constrained multi-objective robust control problem (with data uncertainty in the objective and constraint functionals) we intend to investigate here is formulated as follows:
subject to
where , , , are functionals belonging to (almost averywhere) -class, and represent the uncertainty parameters of the convex subsets and , respectively, and is the jet bundle of second order for K and . Furthermore, assume that the previous multi-variate controlled Lagrangians of second order provide closed controlled Lagrange 1-forms (with summation on the repeated indices)
which generates the following vector of controlled curvilinear integrals (which are independent of the path)
The associated robust counterpart of the aforementioned multi-objective robust control problem is defined as:
subject to
Next, we consider
the feasible solution set in , named the robust feasible solution set for the problem .
From now on, to simplify our presentation, we introduce some notations as follows: .
In the following, we introduce the notion of an efficient solution for the considered class of constrained robust control problems.
Definition 1.
A robust feasible solution is said to be a robust weak efficient solution to the multi-objective robust control problem if there does not exist another point such that
To formulate the concept of convexity and the robust necessary efficiency conditions associated with the aforementioned multi-objective robust control problem, we will use the Saunders’s multi-index notation (see Saunders [], Treanţă []).
Definition 2.
A robust controlled vector functional of curvilinear integral type
is said to be convex (strict convex) at if the following inequality
holds for all .
In accordance with Treanţă [], we formulate the following theorem that provides the robust necessary efficiency conditions for the constrained multi-objective robust control problem .
Theorem 1.
Let be a robust weak efficient solution to the problem . Further assume that . If the constraint conditions (for the existence of the multipliers) hold, then there exist the scalar vector , the piecewise smooth Lagrange multipliers , and the uncertain parameters such that satisfies the following conditions:
hold for all except at discontinuities.
3. Robust Duality of Wolfe Type
In this section, in accordance with Wolfe [], we formulate Wolfe type robust dual problem for the constrained multi-objective robust control problem, with data uncertainty in the objective and constraint functionals , as follows:
The associated robust counterpart for the problem is given as:
for all and
Further, we denote by satisfying conditions (5)–(8)} the set of all feasible solutions to and we say that it is the robust feasible solution set to the problem .
Definition 3.
A point is said to be robust weak efficient solution to the Wolfe type robust dual problem if there does not exist another point such that
Next, we establish the weak duality result for under some convexity assumptions. More precisely, we state that the value attained by the objective functional of the dual problem over its feasible set does not exceed the value attained by the objective functional of the primal problem.
Theorem 2.
(Robust Weak Duality) Let and be robust feasible solutions of and , respectively. Assume that , and and are convex at . Then the following inequality cannot hold
Proof.
Contrary to the result, we assume that
Since , we have
The above inequality together with the robust feasibility of to the problem implies
As and , therefore, the above inequality can be written as
Now, since and are convex at , we have
and
Now, we formulate and prove the strong duality result which states that duality gap is zero.
Theorem 3.
(Robust Strong Duality) Let be a robust weak efficient solution to the problem . Assume that and the constraint conditions (for the existence of multiplier) hold for . Then, there exist the scalar vector , the piecewise smooth Lagrange multipliers and and the uncertain parameters such that is a robust feasible solution to the problem . Further, if the Robust Weak Duality (see Theorem 2) holds, then is a robust weak efficient solution to the problem .
Proof.
Since is a robust weak efficient solution to the problem , by Theorem 1, there exist the scalar vector , the piecewise smooth Lagrange multiplies , and the uncertain parameters such that the conditions (1)–(4) are satisfied at . This proves the robust feasibility of to the problem and the corresponding objective values are equal. If is not a robust weak efficient solution to the problem , then there exists another point such that
From the condition (3), we get
Since , we have
which contradicts the Robust Weak Duality (see Theorem 2). In consequence, the point is a robust weak efficient solution to the problem . □
Theorem 4.
(Robust Strict Converse Duality) Let be a robust feasible solution to the problem . Assume that , and and are strict convex at . If such that , then is a robust weak efficient solution to the problem .
Proof.
Since is a robust feasible solution to the problem , on multiplying the inequality (5) and (6) by and , respectively, and then integrate them, we get
where we used the formula of integration by parts, the divergence formula and the boundary conditions formulated in the considered problem.
Next, we proceed by contradiction and assume that is not a robust weak efficient solution to the problem . Therefore, there exists such that
Since , it follows
By assumption, . Therefore, the above inequality yields
Since , we get
On the other hand, from the assumption that is strict convex at , we have
which together with the inequality (14), gives
Again, by assumption that is strict convex at , we get
Since and are the robust feasible solutions to the problem and , respectively, we obtain
which, along with the inequality (16), involves
Similarly, the functional is also strict convex at . The robust feasible solutions and to the problem and , respectively, yields
On adding the inequalities (15), (17) and (18), we obtain the following inequality
which contradicts the inequality (13). This completes the proof. □
4. Robust Duality of Mond-Weir Type
In this section, in accordance with Weir and Mond [], we formulate the Mond-Weir type robust dual problem for the considered multi-objective nonlinear robust control problem , with data uncertainty in the objective and constraint functionals, as follows:
The associated robust counterpart to the problem is given as follows:
for all .
We denote by satisfying conditions (20)–(25)} the set of all feasible solutions to and we say that it is the robust feasible solution set to the problem .
Now, under convexity hypotheses, we establish the robust weak and strong duality results for and .
Theorem 5.
(Robust Weak Duality) Let and be robust feasible solutions to the problem and , respectively. Assume that , and and are convex at . Then the following inequality cannot hold
Proof.
Contrary to the result, we assume that
Since , we have
By hypothesis, and are convex at . Therefore, we have
and
On adding the inequalities (27), (28) and (29), along with the robust feasibility of and to the problem and (MW-MRCP), respectively, we have
which contradicts the inequality (26). This completes the proof. □
Theorem 6.
(Robust Strong Duality) Let be a robust weak efficient solution to the problem . Assume that and the constraint conditions (for the existence of multiplier) hold for . Then, there exist the scalar vector , the piecewise smooth Lagrange multipliers and and the uncertain parameters such that is a robust feasible solution to the problem (MW-MRCP). Further, if the Robust Weak Duality (see Theorem 5) holds, then is a robust weak efficient solution to the problem (MW-MRCP).
Proof.
Since is a robust weak efficient solution to the problem , by Theorem 1, there exist the scalar vector , the piecewise smooth Lagrange multiplies , and the uncertain such that the conditions (1)–(4) are satisfied at . This implies the robust feasibility of to the problem (MW-MRCP) and the corresponding objective values are equal. If is not a robust weak efficient solution to the problem (MW-MRCP), then there exists another point such that
which contradicts the Robust Weak Duality (see Theorem 5). Hence, is a robust weak efficient solution to the problem (MW-MRCP). □
5. Robust Duality of Mixed Type
In this section, we formulate the mixed type robust dual problem for the multi-objective robust nonlinear control problem as follows:
The associated robust counterpart to the problem is given as follows:
for all .
We denote by satisfying conditions (20)–(25)} the set of all feasible solutions to and we say that it is the robust feasible solution set to the problem .
Theorem 7.
(Robust Weak Duality) Let and be robust feasible solutions to the problem and , respectively. Furthermore, we ssume that , and and are convex at . Then the following inequality cannot be valid
Proof.
The proof follows in the same manner as in Theorem 2. Consequently, we omit it. □
Theorem 8.
(Robust Strong Duality) Let be a robust weak efficient solution to the problem . Assume that and the constraint conditions (for the existence of multiplier) hold for . Then, there exist the scalar vector , the piecewise smooth Lagrange multipliers and , and the uncertain parameters such that is a robust feasible solution to the problem . Further, if the Robust Weak Duality (see Theorem 7) holds, then is a robust weak efficient solution to the problem .
Proof.
The proof follows in the same manner as in Theorem 3. As consequence, we skip it. □
In the following, we present an illustrative application to validate, for example, Theorem 2. The next concrete problem can be solved exclusively by using the theoretical results derived in this paper.
Example 1.
Let us extremize the mechanical work provided by the variable forces
with (uncertain parameters) , , to move its application point along the piecewise smooth curve , that is included in and joins and , so that
(with , for all ) is satisfied.
In order to solve the above practical problem, let us consider and is fixed by the diagonally opposite points and in . Now, we formulate the following constrained multi-objective robust nonlinear control problem:
where
Let be a robust feasible solution to the problem (P).
The robust counterpart of (P) is defined as:
where .
The Wolfe type robust dual problem associated with (P) is defined as follows:
where we denoted and .
The robust counterpart to the problem (WP) is given as:
for all .
We note that satisfying conditions (36)–(39)} is the robust feasible solution set to the (WP). Let us consider . Then is a robust feasible solution to (WP). Further, it can be easily verified that all the involved functionals are convex at . Furthermore, the following inequality
shows that the duality gap is positive. In consequence, Theorem 2 (Robust Weak Duality) is verified.
6. Conclusions
In the current study, we have established various duality results for the new class of constrained robust nonlinear optimization problems . More concretely, we have established and characterized Wolfe, Mond-Weir and mixed type robust dual optimization problems. In addition, an illustrative real-life application was included in the paper in order to validate the theoretical elements. On the other hand, as a possible research line that this study can open (among many other aspects), is the formulating of the derived results by considering the concept of variational/functional derivative.
Author Contributions
Conceptualization, methodology, validation, investigation, writing—original draft preparation, writing—review and editing: S.T. and T.S. All authors have read and agreed to the submitted version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
This research work was funded by Institutional Fund Projects under grant no. (*IFPIP: 96-130-1443*). The authors gratefully acknowledge technical and financial support provided by the Ministry of Education and King Abdulaziz University, DSR, Jeddah, Saudi Arabia.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Du, S.; Xie, X.; Cheng, P. Robust residual- and recovery-based a posteriori error estimators for a multipoint flux mixed finite element discretization of interface problems. Numer. Meth. PDE 2019, 35, 681–698. [Google Scholar] [CrossRef]
- Gao, X. Necessary optimality and duality for multiobjective semi-infinite programming. J. Theor. Appl. Inf. Technol. 2012, 46, 347–354. [Google Scholar]
- Jayswal, A.; Preeti; Arana-Jiménez, M. Robust penalty function method for an uncertain multi-time control optimization problems. J. Math. Anal. Appl. 2022, 505, 125453. [Google Scholar] [CrossRef]
- Jeyakumar, V.; Wang, J.H.; Li, G. Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty. J. Math. Anal. Appl. 2012, 393, 285–297. [Google Scholar] [CrossRef]
- Liu, C.; Gong, Z.; Teo, K.L.; Sun, J.; Caccetta, L. Robust multi-objective optimal switching control arising in 1,3-propanediol microbial fed-batch process. Nonlinear Anal. Hybrid Syst. 2017, 25, 1–20. [Google Scholar] [CrossRef]
- Liu, C.; Gong, Z.; Teo, K.L. Robust parameter estimation for nonlinear multistage time-delay systems with noisy measurement data. Appl. Math. Model. 2018, 53, 353–368. [Google Scholar] [CrossRef]
- Liu, C.; Gong, Z.; Lee, H.W.J.; Teo, K.L. Robust bi-objective optimal control of 1,3-propanediol microbial batch production process. J. Process Control 2019, 78, 170–182. [Google Scholar] [CrossRef]
- Liu, X.W.; Yuan, Y.X. A robust algorithm for optimization with general equality and inequality constraints. SIAM J. Sci. Comput. 2000, 22, 517–534. [Google Scholar] [CrossRef]
- Lu, Z.; Zhu, Y.; Lu, Q. Stability analysis of nonlinear uncertain fractional differential equations with Caputo derivative. Fractals 2021, 29, 2150057. [Google Scholar] [CrossRef]
- Mishra, S.K.; Jaiswal, M.; An, L.T.H. Duality for nonsmooth semiinfinite programming problems. Optim. Lett. 2012, 6, 261–271. [Google Scholar] [CrossRef]
- Mititelu, Ş.; Treanţă, S. Efficiency conditions in vector control problems governed by multiple integrals. J. Appl. Math. Comput. 2018, 57, 647–665. [Google Scholar] [CrossRef]
- Pham, T.H. Optimality conditions and duality for multiobjective semiinfinite programming with data uncertainty via Mordukhovich subdifferential. Yugosl. J. Oper. Res. 2021, 31, 495–514. [Google Scholar] [CrossRef]
- Saunders, D.J. The Geometry of Jet Bundles; London Math. Soc. Lecture Notes Series, 142; Cambridge University Press: Cambridge, UK, 1989. [Google Scholar]
- Sun, X.K.; Teo, K.L.; Zeng, J.; Guo, X.L. On approximate solutions and saddle point theorems for robust convex optimization. Optim. Lett. 2020, 14, 1711–1730. [Google Scholar] [CrossRef]
- Treanţă, S.; Mititelu, Ş. Duality with (ρ,b)-quasiinvexity for multidimensional vector fractional control problems. J. Inform. Optim. Sci. 2019, 40, 1429–1445. [Google Scholar] [CrossRef]
- Treanţă, S. Constrained variational problems governed by second-order Lagrangians. Appl. Anal. 2020, 99, 1467–1484. [Google Scholar] [CrossRef]
- Treanţă, S. On well-posed isoperimetric-type constrained variational control problems. J. Differ. Equ. 2021, 298, 480–499. [Google Scholar] [CrossRef]
- Treanţă, S. Robust saddle-point criterion in second-order PDE&PDI constrained control problems. Int. J. Robust Nonlinear Control 2021, 31, 9282–9293. [Google Scholar]
- Treanţă, S. On a Class of Second-Order PDE&PDI Constrained Robust Modified Optimization Problems. Mathematics 2021, 9, 1473. [Google Scholar]
- Treanţă, S. On a dual pair of multiobjective interval-valued variational control problems. Mathematics 2021, 9, 893. [Google Scholar] [CrossRef]
- Treanţă, S.; Das, K. On robust saddle-point criterion in optimization problems with curvilinear integral functionals. Mathematics 2021, 9, 1790. [Google Scholar] [CrossRef]
- Trélat, E.; Zuazua, E. The turnpike property in finite-dimensional nonlinear optimal control. J. Differ. Equ. 2015, 258, 81–114. [Google Scholar] [CrossRef]
- Tung, L.T. Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions. J. Appl. Math. Comput. 2020, 62, 67–91. [Google Scholar] [CrossRef]
- Wang, S.; Wang, F.; Xu, X. A robust multigrid method for one dimensional immersed finite element method. Numer. Meth. PDE 2021, 37, 2244–2260. [Google Scholar] [CrossRef]
- Wei, H.Z.; Chen, C.R.; Li, S.J. Characterizations for optimality conditions of general robust optimization problems. J. Optim. Theory Appl. 2018, 177, 835–856. [Google Scholar] [CrossRef]
- Weir, T.; Mond, B. Generalised convexity and duality in multiple objective programming. Bull. Aust. Math. Soc. 1989, 39, 287–299. [Google Scholar] [CrossRef]
- Wolfe, P. A duality theorem for non-linear programming. Quart. Appl. Math. 1961, 19, 239–244. [Google Scholar] [CrossRef]
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. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).