Abstract
This paper is devoted to the investigation of a class of uncertain multiobjective fractional semi-infinite optimization problems (\(UMFP \), for brevity). We first obtain, by combining robust optimization and scalarization methodologies, necessary and sufficient optimality conditions for robust approximate weakly efficient solutions of (\(UMFP \)). Then, we introduce a Mixed type approximate dual problem for (\(UMFP \)) and investigate their robust approximate duality relationships. Moreover, we obtain some robust approximate weak saddle point theorems for an uncertain multiobjective Lagrangian function related to (\(UMFP \)).
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Fractional optimization is an important model of nonlinear optimization problems, where the objective function is a ratio of two functions. It is an active research topic over the last several decades due to a wide range of applications in different fields of engineering and economics. There are many papers devoted to the investigation of fractional optimization problems from several different perspectives; see, e.g., [1,2,3,4,5,6,7,8,9,10,11,12,13,14] and the references therein.
As we know, many optimization problems that arise in applications involve uncertainties due to measurement and/or manufacturing errors, imprecise information, fluctuations or disturbances. Consequently, a great deal of attention has been focused on optimization problems with uncertain data. Robust optimization [15, 16] is one of the most effective methods to solve optimization problems with uncertain data. The aim of robust optimization is to find the worst-case solution, which is immunized against the data uncertainty, to the optimization problem. Recently, many researchers have been attracted to work on the theory and applications of uncertain optimization problem in terms of robust optimization methodology, see [17,18,19,20,21,22,23,24,25,26,27,28,29] and the references therein. It appears that there are few papers devoting to the investigation of uncertain fractional optimization problems via robust optimization. More precisely, results on optimality conditions and duality theorems of robust approximate optimal solutions for an uncertain fractional optimization problem are considered in [19]. Robust strong duality for an uncertain fractional optimization problem and its uncertain Wolfe dual optimization problem is obtained in [20] in the framework of robust optimization. Some characterizations of robust optimal solution sets for a class of fractional optimization problems with uncertainty appearing in both the objective and constraints are obtained in [23]. Optimality conditions and duality theorems for an uncertain minimax convex-concave fractional programming problem are established in [25] under a robust type subdifferential constraint qualification condition. Some new results of robust approximate optimal solutions for fractional semi-infinite optimization problems with uncertain data are obtained in [26] under a robust type constraint qualification condition.
These papers mentioned above are mainly devoted to the investigation of single-objective fractional optimization problems with uncertain data. However, many practical optimization models have various goals due to many decision makers, and they have different optimization criteria. Therefore, it is necessary and interesting to deal with multiobjective fractional optimization problems. In the last few decades, multiobjective fractional optimization problems have been studied by many scholars without taking into account data uncertainty. For example, Long et al. [6, 7] obtained optimality conditions, duality and saddle-point results for nondifferentiable multiobjective fractional optimization problems under some generalized convexity assumptions. Verma [8] established some parametric sufficient efficiency conditions for multiobjective fractional optimization problems in terms of generalized invexity assumptions. Using first- and second-order approximations as generalized derivatives, Khanh and Tung [10] derived optimality conditions for nonsmooth multiobjective fractional optimization problems. Chuong [12] established optimality conditions and duality theorems for nondifferentiable fractional semi-infinite multiobjective optimization problems. More recently, some results on optimality and duality for a nonsmooth and nonconvex multiobjective fractional programming problem are obtained in [14] in terms of contingent derivatives.
However, in contrast to the deterministic case, it appears that there exist few papers in the literature devoting to the study of multiobjective fractional optimization problems with uncertain data, see [23]. This is the main motivation to investigate a class of uncertain multiobjective fractional semi-infinite optimization problems (\(UMFP \), for brevity). Our main concern is to provide some new characterizations of robust approximate weakly efficient solutions for (\(UMFP \)). Our contributions can be more specifically stated as follows. By using a robust type constraint qualification condition, we first establish necessary and sufficient optimality conditions for robust approximate weakly efficient solutions for (\(UMFP \)). The obtained results can be regarded as the generalizations of the optimality conditions for approximate weakly efficient solutions of deterministic multiobjective fractional optimization problems. Based on the obtained optimality conditions, we give a Mixed type robust approximate dual problem of (\(UMFP \)). Then, we investigate the weak and strong duality relations between (\(RUMFP \)) and the optimistic counterpart of the uncertain dual problem of (\(UMFP \)). Moreover, we introduce an uncertain approximate multiobjective Lagrangian function related to (\(UMFP \)) and obtain a nonsmooth robust saddle point theorem.
The rest of the paper is organized as follows. Section 2 contains some basic definitions and auxiliary results. In Sect. 3, we obtain necessary and sufficient optimality conditions for robust approximate weakly efficient solutions of (\(UMFP \)). In Sect. 4, we first introduce a Mixed type robust dual problems for (\(UMFP \)), and then discuss the robust approximate duality properties. We also deal with robust approximate saddle point of the uncertain approximate multiobjective Lagrangian function for (\(UMFP \)).
2 Preliminaries
In this section, we give some basic notations and preliminary results from [30], which will be used in the sequel. Let \({\mathbb {R}}^{n}\) be the n-dimensional Euclidean space equipped with the usual Euclidean norm \(\Vert \cdot \Vert \). The nonnegative orthant of \({\mathbb {R}}^{n}\) is defined by \({\mathbb {R}}^{n}_{+}{:}{=}\{(x_{1},...,x_{n})\in {\mathbb {R}}^{n}~|~x_{i}\ge 0\}\). The inner product in \({\mathbb {R}}^{n}\) is denoted by \(\langle x,y\rangle \) for any \(x,y\in {\mathbb {R}}^{n}\). For a set D in \({\mathbb {R}}^{n}\), the closure and the convex hull of D are denoted by \(\mathrm {cl}D\) and \(\mathrm {co}D\), respectively. The indicator function \(\delta _{D}:{\mathbb {R}}^{n}\rightarrow {\mathbb {R}}\cup \{+\infty \}\) of D is defined by
Let T be a nonempty infinite index set, \({\mathbb {R}}^{(T)}\) be the following linear space, which has been used for semi-infinite programming [31],
The nonnegative cone of \({\mathbb {R}}^{(T)}\) is defined by
Let \(\varphi :{\mathbb {R}}^{n}\rightarrow {\mathbb {R}}\cup \{+\infty \}\) be an extended real value function. The effective domain and the epigraph of \(\varphi \) are defined respectively by
The Frenchel conjugate function \(\varphi ^{*}\) of \(\varphi \) is defined by
The function \(\varphi \) is said to be proper if its effective domain is nonempty, and \(\varphi \) is said to be convex if \(\mathrm {epi}\varphi \) is a convex set, or equivalently, \(\varphi (\alpha x+(1-\alpha )y)\le \alpha \varphi (x)+(1-\alpha )\varphi (y)\), for any \(x,y\in {\mathbb {R}}^{n}\) and \(\alpha \in [0,1]\). The function \(\varphi \) is said to be concave if \(-\varphi \) is convex. Moreover, \(\varphi \) is said to be lower semicontinuous if \(\mathrm {epi}\varphi \) is closed. The subdifferential of \(\varphi \) at \({\bar{x}}\in \mathrm {dom}\varphi \) is defined by
For any \(\varepsilon \in {\mathbb {R}}_{+}\), the \(\varepsilon \)-subdifferential of \(\varphi \) at \({\bar{x}}\in \mathrm {dom}\varphi \) is the convex set given by
Obviously, if \(\varphi \) is a proper lower semicontinuous convex function, and if \({\bar{x}}\in \mathrm {dom}\varphi \), then
The following important properties will be used in the sequel.
Lemma 2.1
[32, 33] Let \(\varphi _{1},\varphi _{2}:{\mathbb {R}}^{n}\rightarrow {\mathbb {R}}\cup \{+\infty \}\) be proper convex function such that \(\mathrm {dom}\varphi _{1}\cap \mathrm {dom}\varphi _{2}\ne \emptyset \).
-
(i)
If \(\varphi _{1}\) and \(\varphi _{2}\) are lower semicontinuous, then
$$\begin{aligned} \mathrm {epi}(\varphi _{1}+\varphi _{2})^{*}=\mathrm {cl} (\mathrm {epi}\varphi _{1}^{*}+\mathrm {epi}\varphi _{2}^{*}). \end{aligned}$$ -
(ii)
If one of \(\varphi _{1}\) and \(\varphi _{2}\) is continuous at some \({\bar{x}}\in \mathrm {dom}\varphi _{1}\cap \mathrm {dom}\varphi _{2}\), then
$$\begin{aligned} \mathrm {epi}(\varphi _{1}+\varphi _{2})^{*}=\mathrm {epi}\varphi _{1}^{*} +\mathrm {epi}\varphi _{2}^{*}. \end{aligned}$$
At the end of this section, we recall some notations of multiobjective fractional semi-infinite optimization problems used in this paper. Let \(C\subseteq {\mathbb {R}}^{n}\) be a nonempty closed convex set, and let T be a nonempty infinite index set. In this paper, we focus on the following multiobjective fractional semi-infinite optimization problem
where \(f_{i}, g_{i}:{\mathbb {R}}^{n}\rightarrow {\mathbb {R}}\), \(i=1,...,p \), and \(h_{t}:{\mathbb {R}}^{n}\rightarrow {\mathbb {R}}\), \(t\in T\), are real-valued functions. The problem \(\mathrm {(MFP)}\) with uncertain data in the constraint functions can be captured by the following uncertain multiobjective fractional semi-infinite optimization problem
where \(v_{t}\), \(t\in T\), are uncertain parameters from the uncertainty set \(V_{t}\subseteq {\mathbb {R}}^{q}\), \(t\in T\). \(h_{t}:{\mathbb {R}}^{n}\times {\mathbb {R}}^q\rightarrow {\mathbb {R}}\), \(t\in T\), are given functions.
We consider the robust counterpart of \((UMFP) \), namely
where the feasible set of (\(RUMFP \)) is defined by \( F{:}{=}\{x\in {C}~|~h_{t}(x,v_{t})\le 0,\forall v_{t}\in V_{t},t\in T\}. \) In this paper, we assume that \(f_i\), \(i=1,...,p\), are continuous convex functions with \(f_i(x)\ge 0\), for all \(x\in F\), and \(g_i\), \(i=1,...,p\), are continuous concave functions with \(g_i(x)>0\), for all \(x\in F\).
3 Robust approximate optimality conditions
This section is devoted to derive necessary and sufficient optimality conditions of robust \(\epsilon \)-weakly efficient solutions for \((UMFP) \). It is worth noting that, in this paper, we only deal with robust \(\epsilon \)-weakly efficient solutions for \((UMFP) \), since other kinds of robust approximate efficient solutions can be dealt with similarly. For convenience, we denote \(\epsilon {:}{=}(\epsilon _{1},...,\epsilon _{p})\in {\mathbb {R}}_{+}^{p}\).
Now, we recall some important concepts which will be used later in this paper.
Definition 3.1
Let \(\epsilon \in {\mathbb {R}}^{p}_{+}\). A point \({\bar{x}}\in F\) is said to be a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \) iff there does not exist \(x\in F\) such that
Definition 3.2
[34] We say that robust type constraint qualification condition \(\text {(RCQC)}\) holds iff
where \(\eta {:}{=}(\eta _t)_{t\in T}\in {\mathbb {R}}_{+}^{(T)}\) and \(v\in V\) means that v is a selection of V, i.e., \(v:T\rightarrow {\mathbb {R}}^{p}\) and \(v_{t}\in V_{t}\) for all \(t\in T\).
The following result provides a robust version of Farkas-type results for infinite convex systems with uncertain data.
Lemma 3.1
[34] Let \(\phi :{\mathbb {R}}^{n}\rightarrow {\mathbb {R}}\) be a continuous convex function, and let \(h_{t}:{\mathbb {R}}^{n}\times {\mathbb {R}}^{q}\rightarrow {\mathbb {R}}, t\in T\), be continuous functions such that, for any \(v_{t}\in {\mathbb {R}}^{q}, h_{t}(\cdot ,v_{t})\) is a convex function. Let \(V_{t}\subseteq {\mathbb {R}}^{q}, t\in T\), be compact and let \(F\ne \emptyset \). Then the following statements are equivalent:
-
(i)
\(\{x\in {C}~|~h_{t}(x,v_{t})\le 0, \forall v_{t}\in V_{t},t\in T\}\subseteq \{x\in {C}~|~\phi (x)\ge 0\}\).
-
(ii)
\((0,0)\in \mathrm {epi}\phi ^{*}+\mathrm {cl}\mathrm {co}\left( \bigcup _{v\in V, \eta \in {\mathbb {R}}_{+}^{(T)}}\mathrm {epi}\left( \sum \limits _{t\in T}\eta _{t}h_{t}(\cdot ,v_{t})\right) ^{*}+\mathrm {epi}\delta _{C}^{*}\right) \).
In order to investigate the robust \(\epsilon \)-weakly efficient solution of (\(UMFP \)), we associate (\(RUMFP \)) with the following optimization problem:
where the parametric \(\mu {:}{=}(\mu _{1},...,\mu _{p})\in {\mathbb {R}}_{+}^{p} \).
The following relation between the \(\epsilon \)-weakly efficient solution of (\(RUMFP \)) and (\(RUMFP )_{\mu }\) can be easily obtained by using similar methods of [14, Proposition 1] and [19, Lemma 2.1]. The proof is included here for the sake of completeness.
Lemma 3.2
Let \({\bar{x}}\in F\) and \(\epsilon \in {\mathbb {R}}_{+}^{p}\). Let \({\bar{\mu }}_{i}=\frac{f_i({\bar{x}})}{g_i({\bar{x}})}-\epsilon _{i}\ge 0, i=1,...,p\). Then \({\bar{x}}\in F\) is a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \) if and only if \({\bar{x}}\in F\) is an \({\bar{\epsilon }}\)-weakly efficient solution of (RUMFP) \( _{{\bar{\mu }}}\), where \({\bar{\mu }} {:}{=}({\bar{\mu }}_{1},...,{\bar{\mu }}_{p})\) and \({\bar{\epsilon }}{:}{=}(\epsilon _1 g_1({\bar{x}}),...,\epsilon _pg_{p}({\bar{x}}))\).
Proof
(\(\Rightarrow \)) On the contrary, we assume that \({\bar{x}}\in F\) is not a robust \({\bar{\epsilon }}\)-weakly efficient solution of (RUMFP) \(_{{\bar{\mu }}}\). Then, there exists \( {\hat{x}}\in F\) such that
Then, together with \({\bar{\mu }}_{i}=\frac{f_i({\bar{x}})}{g_i({\bar{x}})}-\epsilon _{i}\) and \({\bar{\epsilon }}_i=\epsilon _i g_i({\bar{x}})\), \(i=1,..p,\) we obtain
Therefore, \({\bar{x}}\) is not a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \). We arrive at a contradiction. Thus, \({\bar{x}}\in F\) is an \({\bar{\epsilon }}\)-weakly efficient solution of (\(RUMFP \))\(_{{\bar{\mu }}}\).
(\(\Leftarrow \)) Assume that \({\bar{x}}\in F\) is an \({\bar{\epsilon }}\)-weakly efficient solution of \((RUMFP )\) \(_{{\bar{\mu }}}\). Similarly, it is easy to show that \({\bar{x}}\in F\) is a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \). The proof is complete. \(\square \)
Now, we establish necessary and sufficient optimality conditions of robust \(\epsilon \)-weakly efficient solutions for \((UMFP) \).
Theorem 3.1
Let \({\bar{x}}\in F\), \(\epsilon \in {\mathbb {R}}_{+}^{p}\), and \({\bar{\mu }}_{i}=\frac{f_i({\bar{x}})}{g_i({\bar{x}})}-\epsilon _{i}\ge 0\), \(i=1,...,p\). Let \(h_{t}(\cdot ,v_{t}):{\mathbb {R}}^{n}\times {\mathbb {R}}^{q}\rightarrow {\mathbb {R}}\), \(t\in T\), be continuous functions such that, for any \(v_{t}\in V_{t}\), \(h_{t}(\cdot ,v_{t})\) is a convex function. If \((RCQC) \) holds, then \({\bar{x}}\) is a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \) if and only if there exist \({\bar{\lambda }}_{i}\ge 0\), \(\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}=1\), \(\epsilon _{i}^{'}\ge 0\), \(\epsilon _{i}^{''}\ge 0\), \(i=1,...,p,\) \( {\bar{\eta }}_{t}\ge 0 \), \({\bar{v}}_{t}\in V_{t}\), \(\epsilon _{t}^{0}\ge 0\), \(t\in T\), and \(\epsilon ^{c}\ge 0\), such that
and
Proof
\((\Rightarrow )\) Let \({\bar{x}}\in F\) be a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \). It follows from Lemma 3.2 that \({\bar{x}}\) is an \({\bar{\epsilon }}\)-weakly efficient solution of (\(RUMFP \))\(_{{\bar{\mu }}}\), where \({\bar{\mu }}=({\bar{\mu }}_{1},...,{\bar{\mu }}_{p})\) and \({\bar{\epsilon }}=(\epsilon _1 g_1({\bar{x}}),...,\epsilon _pg_{p}({\bar{x}}))\). By [22, Proposition 5.3], there exist \({\bar{\lambda }}_{i}\ge 0\), \(i=1,...,p\), and \(\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}=1\), such that
For any \(x\in {C}\), set \( \phi (x){:}{=}\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}\left( f_{i}(x)-{\bar{\mu }}_{i} g_{i}(x)\right) . \) Then,
By Lemma 3.1, we have
Since (\(RCQC \)) holds, it follows that
By Lemma 2.1, we obtain
and
Then, together with (4), (5), and (6), we obtain
So, there exist \({\bar{\eta }}_{t}\ge 0\) and \({\bar{v}}_{t}\in V_{t}\), \(t\in T\), such that
This means that there exist \(\left( \xi _{i}^{'},r_{i}^{'}\right) \in \mathrm {epi} ({\bar{\lambda }}_{i}f_{i})^{*}\), \(\left( \xi _{i}^{''},r_{i}^{''}\right) \in \mathrm {epi} (-{\bar{\lambda }}_{i}{\bar{\mu }}_{i}g_{i})^{*}\), \(i=1,...p, \) \((\xi _{t},r_{t})\in \mathrm {epi}\left( {\bar{\eta }}_{t}h_{t}(\cdot ,{\bar{v}}_{t})\right) ^{*}\), \(t\in T,\) and \((\xi _{c},r_{c})\in \mathrm {epi}\delta _{C}^{*}\), such that
Moreover, by (1), there exist \(\epsilon _{i}^{'}\ge 0\), \(\epsilon _{i}^{''}\ge 0\), \(i=1,...,p\), and \(\epsilon _{t}^{0}\ge 0\), \(t\in T\), such that
and
It follows from (7) that
and
\((\Leftarrow )\) Suppose that there exist \({\bar{\lambda }}_{i}\ge 0\), \(\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}=1\), \(\epsilon _{i}^{'}\ge 0\), \(\epsilon _{i}^{''}\ge 0\), \(i=1,...,p,\) \({\bar{\eta }}_{t}\ge 0\), \({\bar{v}}_{t}\in V_{t}\), \(\epsilon _{t}^{0}\ge 0\), \(t\in T\), and \(\epsilon ^{c}\ge 0\), such that (2) and (3) hold. By (2), there exist \(\xi _{i}^{'}\in \partial _{\epsilon _{i}^{'}}({\bar{\lambda }}_{i}f_{i})({\bar{x}})\), \(\xi _{i}^{''}\in \partial _{\epsilon _{i}^{''}}(-{\bar{\lambda }}_{i}{\bar{\mu }}_{i}g_{i})({\bar{x}})\), \(i=1,...,p\), \(\xi _{t}\in \partial _{\epsilon _{t}^{0}}\left( {\bar{\eta }}_{t}h_{t}(\cdot ,{\bar{v}}_{t})\right) ({\bar{x}})\), \(t\in T\), and \(\xi _{c}\in \partial _{\epsilon ^{c}}\delta _{C}({\bar{x}})\), such that
From \(\xi _{i}^{'}\in \partial _{\epsilon _{i}^{'}}({\bar{\lambda }}_{i}f_{i})({\bar{x}})\), \(\xi _{i}^{''}\in \partial _{\epsilon _{i}^{''}}(-{\bar{\lambda }}_{i}{\bar{\mu }}_{i}g_{i})({\bar{x}})\), \(i\!=\!1,...,p\), \(\xi _{t}\in \partial _{\epsilon _{t}^{0}}\left( {\bar{\eta }}_{t}h_{t}(\cdot ,{\bar{v}}_{t})\right) ({\bar{x}})\), \(t\in T\), and \(\xi _{c}\in \partial _{\epsilon ^{c}}\delta _{C}({\bar{x}})\), it follows that, for any \(x\in F\),
Then, adding these inequalities yields
Together with \(\sum \limits _{t\in T}{\bar{\eta }}_{t}h_{t}(x,{\bar{v}}_{t})\le 0\) and (8), we obtain
Therefore, it follows from [22, Proposition 5.3] that \({\bar{x}}\) is an \({\bar{\epsilon }}\)-weakly efficient solution of \((RUMFP) _{{\bar{\mu }}}\), where \({\bar{\epsilon }} =(\epsilon _{1}g_{1}({\bar{x}}),...,\epsilon _{p}g_{p}({\bar{x}}))\). Thus, by Lemma 3.2, \({\bar{x}}\) is a robust \( {\epsilon }\)-weakly efficient solution of \((UMFP) \). The proof is complete. \(\square \)
Remark 3.1
Theorem 3.1 encompasses [26, Theorem 3.1] for the case of scalar optimization problem, where the corresponding results were obtained by applying similar approaches.
Now, we give an example to illustrate the results obtained in Theorem 3.1.
Example 3.1
Let \(x\in {\mathbb {R}}\), \(C{:}{=}{\mathbb {R}}_{+}\) and \(v_{t}\in V_{t}{:}{=}[-t+2,t+2]\) for any \(t\in T{:}{=}[0,1]\). Consider the following multiobjective fractional optimization problem
Obviously, \(f_{1}(x) =x^{2}+1\), \(f_{2}(x) =2x^{2}+1\), \(g_{1}(x) =x+2\), \(g_{2}(x) =2x+2\), and \(h_{t}(x,v_{t})=tx^{2}-2v_{t}x\), \(\forall t\in T\). It is easy to show that \(F=[0,2]\) and the assumptions of Theorem 3.1 are satisfied.
Let \({\bar{x}}{:}{=}0\in F \) and \(\epsilon {:}{=} (\frac{1}{4},\frac{1}{4})\). Obviously, \({\bar{\epsilon }}= (\frac{1}{2},\frac{1}{2})\), \({\bar{\mu }}=(\frac{1}{4},\frac{1}{4})\), and \({\bar{x}}\) is a robust \( {\epsilon }\)-weakly efficient solution of \((UFMP) \). Moreover, there exist \(\epsilon _{i}'=\epsilon _{i}''=\epsilon _{c}=\frac{1}{32}\), \({\bar{\lambda }}_{i}=\frac{1}{2}\), \(i=1,2\), \({\bar{v}}_{t}=t+2\), \(t\in T\), \({\bar{\eta }}_t{:}{=} \left\{ \begin{array}{l} 0, \mathrm { ~~~if ~~}t\in (0,1] , \\ \frac{1}{32}, \mathrm {~~if~~} t=0, \end{array} \right. \) and \(\epsilon _{t}^{0}{:}{=} \left\{ \begin{array}{l} 0, \mathrm { ~~~if ~~}t\in (0,1] , \\ \frac{11}{32}, \mathrm {~~if~~} t=0, \end{array} \right. \) such that
Clearly,
and
Thus, Theorem 3.1 is applicable.
4 Robust approximate duality and saddle point theorems
In this section, we introduce a Mixed type robust multiobjective dual problem for (\(UMFP \)), and then investigate the robust approximate weak and strong duality properties between them. Moreover, we also introduce an uncertain approximate multiobjective Lagrangian function related to (\(UMFP \)) and obtain a nonsmooth robust saddle point theorem. Here, we only focus on their robust \(\epsilon \)-weakly efficient solutions since other kinds of robust approximate efficient solutions can be dealt with in a similar manner. For convenience, we use the notations \(f{:}{=}(f_{1},...,f_{p})\), \(g{:}{=}(g_{1},...,g_{p})\), \(\eta {:}{=}(\eta _{t})_{t}\in {\mathbb {R}}_{+}^{(T)}\), \(\beta {:}{=}(\beta _{t})_{t}\in {\mathbb {R}}_{+}^{(T)}\), \(\lambda {:}{=}(\lambda _{1},..,\lambda _{p})\in {\mathbb {R}}_{+}^{p}\backslash \{0\}\) and \(\mu {:}{=}(\mu _{1},..,\mu _{p})\in {\mathbb {R}}_{+}^{p}\).
Let \(y\in C\), \(\epsilon \in {\mathbb {R}}_{+}^{p}\), \(\eta \in {\mathbb {R}}_{+}^{(T)}\), \(\beta \in {\mathbb {R}}_{+}^{(T)}\), \(\lambda \in {\mathbb {R}}_{+}^{p}\backslash \{0\}\) and \(\mu \in {\mathbb {R}}_{+}^{p}\). For fixed \(v_{t}\in V_{t}\), \(t\in T\), the conventional Mixed type multiobjective dual problem \((\mathrm {MD})\) of (\(UMFP \)) is given by
The optimistic counterpart \((\mathrm {OMD})\) of \(\mathrm {(MD)}\), called optimistic dual optimization problem, is a deterministic maximization problem given by
Here, the feasible set of \((OMD) \) is defined by \(F_{\mathrm {(OMD)}}\).
Remark 4.1
Obviously, if \(\eta _{t}=0\), \(t\in T\), \((OMD) \) collapses to Mond-Weir type optimistic dual optimization problem of (\(UMFP \)) as follows:
On the other hand, if \(\beta _{t}=0\), \(t\in T\), \((OMD) \) collapses to Wolfe type optimistic dual optimization problem of (\(UMFP \)) as follows:
Now, similar to the concept of robust \(\epsilon \)-weakly efficient solutions of \(\mathrm {(UMFP) }\) in Definition 3.1, we give hereafter such \(\epsilon \)-weakly efficient solutions for \((OMD )\). In what follows, for \(w_1,\) \(w_2\in {\mathbb {R}}^p\), we use the following notations for convenience.
Here, \(\mathrm {int}~{\mathbb {R}}^{p}_{+}{:}{=}\{(x_{1},...,x_{p})\in {\mathbb {R}}^{p}~|~x_{i}>0\}\).
Definition 4.1
Let \(\epsilon \in {\mathbb {R}}_{+}^{p}\). We say that \(({\bar{y}},{\bar{\lambda }},{\bar{\mu }},{\bar{\eta }},{\bar{\beta }},{\bar{v}})\in F_{\mathrm {(OMD)}}\) is an \(\epsilon \)-weakly efficient solution of \((OMD )\) if there does not exist \(( {y}, {\lambda }, {\mu }, {\eta }, {\beta }, {v})\in F_{\mathrm {(OMD)}}\), such that \( {\bar{\mu }}\prec \mu -\epsilon . \)
Remark 4.2
Clearly, if \(\epsilon =0\) and \(V_t\), \(t\in T\), are singletons, the \(\epsilon \)-weakly efficient solution of \((OMD )\) reduces to the usual weakly efficient solution of the corresponding deterministic optimization problem. For more details, see [12, 14].
The following two theorems describes \(\epsilon \)-duality relations between \(\mathrm {(RUMFP) }\) and \(\mathrm {(OMD)}\).
Theorem 4.1
(\(\epsilon \,{-}\,\) weak duality) Let \(\epsilon \in {\mathbb {R}}_{+}^{p}\). For any feasible x of \(\mathrm {(RUMFP) }\) and any feasible \(( {y}, {\lambda }, {\mu }, {\eta }, {\beta }, {v})\) of \(\mathrm {(OMD)}\), it holds that \( \left( \frac{f_1(x)}{g_1(x)},...,\frac{f_p(x)}{g_p(x)}\right) \nprec \mu -\epsilon . \)
Proof
On the contrary, we assume that
Since \(( {y}, {\lambda }, {\mu }, {\eta }, {\beta }, {v})\) is a feasible solution of \(\mathrm {(OMD)}\), we have \(y\in C\), \(\lambda _i> 0\), \(\mu _{i}\ge 0\), \(\epsilon _{i}^{'}\ge 0\), \(\epsilon _{i}^{''}\ge 0\), \(i=1,...,p\), \(\epsilon ^{c}\ge 0\), \(\eta _{t}\ge 0\), \(\beta _{t}\ge 0\), \(\epsilon _{t}^{0}\ge 0\), \(v_{t}\in V_{t}\), \(t\in T\), and
and
It follows from (11) that there exist \(\xi _{i}^{'}\in \partial _{\epsilon _{i}^{'}}(\lambda _{i}f_{i})(y)\), \(\xi _{i}^{''}\in \partial _{\epsilon _{i}^{''}}(-\lambda _{i}\mu _{i}g_{i})(y)\), \(i=1,...,p,\) \(\xi _{t}\in \partial _{\epsilon _{t}^{0}}\left( (\eta _{t}+\beta _{t}) h_{t}(\cdot ,v_{t})\right) (y)\), \(t\in T\), and \(\xi _{c}\in \partial _{\epsilon ^{c}}\delta _{C}(y)\), such that
Note that for any \(x\in F\), we have \((\eta _{t}+\beta _{t})h_{t}(x,v_{t})\le 0\), \(\forall t\in T\), and \(g(x)>0\). Together with (12), (13), and (14), it gives
This implies that there exists \(i_0\in \{1,...,p\}\) such that \(f_{i_0}(x)- \mu _{i_0}g_{i_0}(x)+ \epsilon _{i_0}g_{i_0}(x)\ge 0.\) The inequality is equivalent to
which is a contradiction to (10). The proof is complete. \(\square \)
Theorem 4.2
(\(\epsilon \,{-}\,\) strong duality) Let \({\bar{x}}\in F\) and \(\epsilon \in {\mathbb {R}}_{+}^{p} \). Let \(h_{t}:{\mathbb {R}}^{n}\times {\mathbb {R}}^{q}\rightarrow {\mathbb {R}},t\in T\), be continuous functions such that, for any \(v_{t}\in V_{t},h_{t}(\cdot ,v_{t})\) is a convex function. Assume that \((RCQC )\) holds. If \({\bar{x}}\) is a robust \(\epsilon \)-weakly efficient solution of \(\mathrm {(UMFP)}\) and \(\frac{f_{i}({\bar{x}})}{g_{i}({\bar{x}})}-\epsilon _{i}\ge 0\), then there exist \({\bar{\lambda }}\in {\mathbb {R}}_{+}^{p}\backslash \{0\} \), \({\bar{\mu }}\in {\mathbb {R}}_{+}^{p} \), \( {\bar{\eta }} \in {\mathbb {R}}_{+}^{(T)}\), \({\bar{v}} \in V \), such that \(({\bar{x}},{\bar{\lambda }},{\bar{\mu }},0,{\bar{\eta }},{\bar{v}})\) is a \(2\epsilon \)-weakly efficient solutions of \((OMD )\).
Proof
Let \({\bar{\mu }}_{i}{:}{=}\frac{f_{i}({\bar{x}})}{g_{i}({\bar{x}})}-\epsilon _{i}\ge 0\), \(i=1,...,p\). Then,
By Theorem 3.1, there exist \({\bar{\lambda }}_{i}\ge 0\), \(\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}=1\), \(\epsilon _{i}^{'}\ge 0\), \(\epsilon _{i}^{''}\ge 0\), \(i=1,...,p,\) \( {\bar{\eta }}_{t}\ge 0 \), \({\bar{v}}_{t}\in V_{t}\), \(\epsilon _{t}^{0}\ge 0\), \(t\in T\), and \(\epsilon ^{c}\ge 0\), such that
and
From (15), (16), and (17), we can deduce that \(({\bar{x}},{\bar{\lambda }},{\bar{\mu }},0,{\bar{\eta }},{\bar{v}})\) is a robust feasible solution of \(\text {(OMD)}\). By Theorem 4.1, for any feasible solution \(( {y}, {\lambda }, {\mu }, {\eta }, {\beta }, {v})\) of \(\text {(OMD)}\),
Thus, \(({\bar{x}},{\bar{\lambda }},{\bar{\mu }},0,{\bar{\eta }},{\bar{v}})\) is a \(2\epsilon \)-weakly efficient solutions of \(\text {(OMD)}\). The proof is complete. \(\square \)
At the end of this section, we give an \(\epsilon \)-weak saddle point theorem for \(\mathrm { (UMFP)}\). We first define an uncertain multiobjective Lagrangian-type function related to \(\mathrm { (UMFP)}\) as follows:
where \(x\in C\), \(\mu {:}{=}(\mu _{1},..,\mu _{p})\in {\mathbb {R}}_{+}^{p}\), \({\eta } {:}{=}(\eta _t)_{t\in T}\in {\mathbb {R}}^{(T)}_+\), \(v {:}{=}(v_t)_{t\in T}\in {V} \) and \(e{:}{=}(1,...,1)\in {\mathbb {R}}^p\).
Now, we introduce a new concept of robust \(\epsilon \)-weak saddle points of \(L_{\mu }\) related to \(\mathrm { (UMFP)}\).
Definition 4.2
Let \(\epsilon \in {\mathbb {R}}^p_+ \) and \(C\subseteq {\mathbb {R}}^n\). We say that \(({\bar{x}},{\bar{\eta }} ,{\bar{v}} )\in C\times {\mathbb {R}}^{(T)}_+\times V \) is a robust \(\epsilon \)-weak saddle points of \(L_{\mu }\) related to \(\mathrm { (UMFP)}\), iff for any \(( {x}, {\eta } , {v} )\in C\times {\mathbb {R}}^{(T)}_+\times V \),
where \({\bar{\epsilon }} =(\epsilon _1g_1({\bar{x}}),...,\epsilon _pg_p({\bar{x}}))\) and \({\bar{\mu }}=({\bar{\mu }}_{1},...,{\bar{\mu }}_{p}) =\left( \frac{f_{1}({\bar{x}})}{g_{1}({\bar{x}})} -\epsilon _{1},...,\frac{f_{p}({\bar{x}})}{g_{p}({\bar{x}})}-\epsilon _{p}\right) \).
Now, we present an example to explain the existence of robust \(\epsilon \)-weak saddle point.
Example 4.1
Let \(C{:}{=}[-1,1]\), \(x\in {\mathbb {R}}\), and \(v_{t}\in V_{t}{:}{=} [2-t,2+t]\), \(t\in T{:}{=}[0,1)\). Consider the functions
and
Then, for any \(( {x}, {\eta } , {v} )\in C\times {\mathbb {R}}^{(T)}_+\times V \) and \( {\mu }\in {\mathbb {R}}_+^p\), the uncertain multiobjective Lagrangian-type function \(L_{\mu }\) related to \(\mathrm { (UMFP)}\) is
Now, let \({\bar{x}}{:}{=}0\) and \( \epsilon =(\epsilon _1,\epsilon _2){:}{=}(\frac{1}{4},\frac{1}{4})\). Then, \({\bar{\epsilon }}=({\bar{\epsilon }}_{1},{\bar{\epsilon }}_{2}) =\left( \frac{1}{2},\frac{1}{2}\right) \) and \({\bar{\mu }}=\left( \frac{f_{1}({\bar{x}})}{g_{1}({\bar{x}})}-\epsilon _{1}, \frac{f_{2}({\bar{x}})}{g_{2}({\bar{x}})}-\epsilon _{2}\right) =(\frac{1}{4},\frac{1}{4})\). By selecting \({\bar{\eta }}_t{:}{=} \left\{ \begin{array}{l} 0, \mathrm { ~~if ~~}t\in (0,1) , \\ \frac{1}{4}, \mathrm {~~if~~} t=0, \end{array} \right. \) and \({\bar{v}}_{t}:=2-t\), \(t\in [0,1)\). It is easy to show that
and
Obviously, for any \(( {x}, {\eta } , {v} )\in C\times {\mathbb {R}}^{(T)}_+\times V \),
This means that \(({\bar{x}},{\bar{\eta }},{\bar{v}})\) is a robust \(\epsilon \)-weak saddle point.
The following theorem is a robust \(\epsilon \)-weak saddle point theorem of \(L_{\mu }\) related to \((UMFP) \). This is a new result on robust \(\epsilon \)-saddle point theorem for multiobjective fractional optimization not yet being considered in the literature.
Theorem 4.3
Let \({\bar{x}}\in F\), \(\epsilon \in {\mathbb {R}}_{+}^{p}\), and \({\bar{\mu }}_{i}=\frac{f_i({\bar{x}})}{g_i({\bar{x}})}-\epsilon _{i}\ge 0\), \(i=1,...,p\). Let \(h_{t}(\cdot ,v_{t}):{\mathbb {R}}^{n}\times {\mathbb {R}}^{q}\rightarrow {\mathbb {R}}\), \(t\in T\), be continuous functions such that, for any \(v_{t}\in V_{t}\), \(h_{t}(\cdot ,v_{t})\) is a convex function. Assume that \(\mathrm {(RCQC)}\) holds. If \({\bar{x}}\in F\) is a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \), then there exist \({\bar{\eta }} =({\bar{\eta }}_t)_{t\in T}\in {\mathbb {R}}^{(T)}_+\), and \({\bar{v}}=({\bar{v}}_t)_{t\in T}\in {V} \), such that \(({\bar{x}},{\bar{\eta }} ,{\bar{v}} )\in C\times {\mathbb {R}}^{(T)}_+\times V\) is a robust \(\epsilon \)-weak saddle point of \(L_{\mu }\) related to \((UMFP) \).
Proof
Since \({\bar{x}}\) is a robust \(\epsilon \)-weakly efficient solution of (\(UMFP \)), it follows from Theorem 3.1 that there exist \({\bar{\lambda }}_{i}\ge 0,\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}=1\), \(\epsilon _{i}^{'}\ge 0\), \(\epsilon _{i}^{''}\ge 0\), \(i=1,...,p, \) \( {\bar{\eta }}_{t}\ge 0\), \({\bar{v}}_{t}\in V_{t}\), \(\epsilon _{t}^{0}\ge 0\), \(t\in T\), and \(\epsilon ^{c}\ge 0\), such that (2) and (3) hold. By (2), there exist \(\xi _{i}^{'}\in \partial _{\epsilon _{i}^{'}}({\bar{\lambda }}_{i}f_{i})({\bar{x}})\), \(\xi _{i}^{''}\in \partial _{\epsilon _{i}^{''}}(-{\bar{\lambda }}_{i} {\bar{\mu }}_{i}g_{i})({\bar{x}})\), \(i=1,...,p, \) \(\xi _{t}\in \partial _{\epsilon _{t}^{0}}\left( {\bar{\eta }}_{t}h_{t} (\cdot ,{\bar{v}}_{t})\right) ({\bar{x}})\), \(t\in T,\) and \(\xi _{c}\in \partial _{\epsilon ^{c}}\delta _{C}({\bar{x}})\), such that
Moreover, from \(\xi _{i}^{'}\in \partial _{\epsilon _{i}^{'}}({\bar{\lambda }}_{i}f_{i})({\bar{x}})\), \(\xi _{i}^{''}\in \partial _{\epsilon _{i}^{''}}(-{\bar{\lambda }}_{i}{\bar{\mu }}_{i}g_{i})({\bar{x}})\), \(i=1,...,p, \) \(\xi _{t}\in \partial _{\epsilon _{t}^{0}}\left( {\bar{\eta }}_{t}h_{t}(\cdot ,{\bar{v}}_{t})\right) ({\bar{x}})\), \(t\in T,\) and \(\xi _{c}\in \partial _{\epsilon ^{c}}\delta _{C}({\bar{x}})\), it follows that, for any \(x\in C\),
These, together with (3) and (18), imply that for any \(x\in F\),
Moreover, by \({\bar{x}}\in F\), we get \(h_{t}({\bar{x}},{\bar{v}}_{t})\le 0\), \(\forall t\in T\). Then,
Assume that there exists \({\hat{x}}\in C\) such that \( L_{{\bar{\mu }}}({\hat{x}},{\bar{\eta }} ,{\bar{v}} )+ {\bar{\epsilon }} \prec L_{{\bar{\mu }}}({\bar{x}},{\bar{\eta }} ,{\bar{v}} ). \) That is
Thus,
This contradicts (19).
On the other hand, assume to the contrary that there exist \({\hat{\eta }} \in {\mathbb {R}}^{(T)}_+\), and \({\hat{v}} \in V\) such that \( L_{{\bar{\mu }}}({\bar{x}},{\bar{\eta }} ,{\bar{v}} )\prec L_{{\bar{\mu }}}({\bar{x}},{\hat{\eta }} ,{\hat{v}} )-{\bar{\epsilon }}. \) This implies that
Since \(\sum \limits _{i=1}^{p}{\bar{\lambda }}_{i}=1\), we deduce from (20) that
Now, we will get a contradiction. Indeed, from (3), we have
By \({\bar{x}}\in F\), we get \( h_{t}({\bar{x}},{\hat{v}}_{t})\le 0\), \(\forall t\in T\). Therefore,
which contradicts (21). The proof is complete. \(\square \)
The following result can be easily obtained by using similar methods reported in [24, Theorem 6.7].
Theorem 4.4
Let \(\epsilon \in {\mathbb {R}}_{+}^{p}\). If \(({\bar{x}},{\bar{\eta }} ,{\bar{v}} )\in C\times {\mathbb {R}}^{(T)}_+\times V\) is a robust \(\epsilon \)-weak saddle point of \(L_{\mu }\) related to \((UMFP) \), then, \({\bar{x}}\in F\) is a robust \(\epsilon \)-weakly efficient solution of \((UMFP) \).
5 Conclusions
In this paper, following the framework of robust optimization, we consider robust \(\epsilon \)-weakly efficient solutions for a class of nonsmooth multiobjective fractional semi-infinite optimization problems with uncertain data in the constraint functions. We employ a scalarization method and a robust type constraint qualification condition to establish necessary and sufficient conditions for the robust \(\epsilon \)-weakly efficient solutions of this uncertain fractional semi-infinite optimization problem. We also obtain some robust \(\epsilon \)-duality properties and \(\epsilon \)-weak saddle point theorems. It is worth noting that the approach used in this paper is new, and some existing results in the literature can be obtained by the use of our approach. Moreover, the mathematical framework developed in this paper can be extended to the investigation of robust \(\epsilon \)-quasi (weakly) efficient solutions for uncertain multiobjective fractional semi-infinite optimization.
References
Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 1967, 492–498 (1967)
Egudo, R.: Multiobjective fractional duality. Bull. Austral. Math. Soc. 37, 367–378 (1988)
Liu, J.C., Yokoyama, K.: \(\epsilon \)-Optimality and duality for multiobjective fractional programming. Comput. Math. Appl. 37, 119–128 (1999)
Yang, X.M., Teo, K.L., Yang, X.Q.: Symmetric duality for a class of nonlinear fractional programming problems. J. Math. Anal. Appl. 271, 7–15 (2002)
Yang, X.M., Yang, X.Q., Teo, K.L.: Duality and saddle-point type optimality for generalized nonlinear fractional programming. J. Math. Anal. Appl. 289, 100–109 (2004)
Long, X.J., Huang, N.J., Liu, Z.B.: Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs. J. Ind. Manag. Optim. 4, 287–298 (2008)
Long, X.J.: Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C, \alpha, \rho, d)\)-convexity. J. Optim. Theory Appl. 148, 197–208 (2011)
Verma, R.U.: Weak \(\epsilon \)-efficiency conditions for multiobjective fractional programming. Appl. Math. Comput. 219, 6819–6827 (2013)
Antczak, T.: Parametric saddle point criteria in semi-infinite minimax fractional programming problems under \((p, r)\)-invexity. Numer. Funct. Anal. Optim. 36, 1–28 (2015)
Khanh, P.Q., Tung, L.T.: First- and second-order optimality conditions for multiobjective fractional programming. Top 23, 419–440 (2015)
Aubry, A., Carotenuto, V., De Maio, A.: New results on generalized fractional programming problems with Toeplitz quadratics. IEEE Signal Process. Lett. 23, 848–852 (2016)
Chuong, T.D.: Nondifferentiable fractional semi-infinite multiobjective optimization problems. Oper. Res. Lett. 44, 260–266 (2016)
Stancu-Minasian, I.M.: A ninth bibliography of fractional programming. Optimization 68, 2125–2169 (2019)
Su, T.V., Hang, D.D.: Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints. 4OR-Q. J. Oper. Res. (2021). https://doi.org/10.1007/s10288-020-00470-x
Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)
Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464–501 (2011)
Beck, A., Ben-Tal, A.: Duality in robust optimization: primal worst equals dual best. Oper. Res. Lett. 37, 1–6 (2009)
Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: an overview. Eur. J. Oper. Res. 235, 471–483 (2014)
Lee, J.H., Lee, G.M.: On \(\epsilon \)-solutions for robust fractional optimization problems. J. Inequal. Appl. 2014, 501 (2014)
Sun, X.K., Chai, Y.: On robust duality for fractional programming with uncertainty data. Positivity. 18, 9–28 (2014)
Ide, J., Schöbel, A.: Robustness for uncertain multiobjective optimization: a survey and analysis of different concepts. OR Spectrum. 38, 235–271 (2016)
Sun, X.K., Li, X.B., Long, X.J., Peng, Z.Y.: On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization. Pac. J. Optim. 13, 621–643 (2017)
Sun, X.K., Long, X.J., Fu, H.Y., Li, X.B.: Some characterizations of robust optimal solutions for uncertain fractional optimization and applications. J. Ind. Manag. Optim. 13, 803–824 (2017)
Fakhar, M., Mahyarinia, M.R., Zafarani, J.: On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization. Eur. J. Oper. Res. 265, 39–48 (2018)
Li, X.B., Wang, Q.L., Lin, Z.: Optimality conditions and duality for minimax fractional programming problems with data uncertainty. J. Ind. Manag. Optim. 15, 1133–1151 (2019)
Zeng, J., Xu, P., Fu, H.Y.: On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data. J. Inequal. Appl. 2019, 45 (2019)
Sun, X.K., Teo, K.L., Tang, L.P.: Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems. J. Optim. Theory Appl. 182, 984–1000 (2019)
Wei, H.Z., Chen, C.R., Li, S.J.: A unified approach through image space analysis to robustness in uncertain optimization problems. J. Optim. Theory Appl. 184, 466–493 (2020)
Wei, H.Z., Chen, C.R., Li, S.J.: Robustness characterizations for uncertain optimization problems via image space analysis. J. Optim. Theory Appl. 186, 459–479 (2020)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Goberna, M.A., López, M.A.: Linear Semi-infinite Optimization. Wiley, Chichester (1998)
Rockafellar, R.T.: Extension of Fenchels duality theorem for convex functions. Duke Math. J. 33, 81–89 (1966)
Fang, D.H., Li, C., Ng, K.F.: Constraint qualifications for extended Farkass lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. 20, 1311–1332 (2009)
Sun, X.K., Fu, H.Y., Zeng, J.: Robust approximate optimality conditions for uncertain nonsmooth optimization with infinite number of constraints. Mathematics. 7, 12 (2019)
Acknowledgements
The authors would like to thank the anonymous referees for valuable comments and suggestions, which helped to improve the paper
Funding
This research was supported by the Natural Science Foundation of Chongqing (cstc2020jcyj-msxmX0016), the ARC Discovery Grant (DP190103361), the Education Committee Project Foundation of Chongqing for Bayu Young Scholar, the Project of CTBU (ZDPTTD201908), and the Innovation Project of CTBU (yjscxx2021-112-58).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Sun, X., Feng, X. & Teo, K.L. Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data. Optim Lett 16, 1457–1476 (2022). https://doi.org/10.1007/s11590-021-01785-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-021-01785-2