Abstract
In this paper, we consider a multiobjective optimization problem with vanishing constraints, in which its objective functions are continuously differentiable and its constraints are convex, not necessarily differentiable. We introduce two new Abadie-type constraint qualifications and present some necessary condition for properly efficient solutions of the problem, using convex subdifferential.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Given continuously differentiable functions \(f_j :{\mathbb {R}}^n\rightarrow {\mathbb {R}}\) as \(j\in J:=\{1,\ldots ,p\}\), and convex functions \(g_i,h_i :{\mathbb {R}}^n\rightarrow {\mathbb {R}}\) as \(i\in I:=\{1,\ldots ,m\}\), we define the “multiobjective mathematical programming with vanishing constraints” (MMPVC in brief) as
The above assumptions about objective and constraint functions are standing throughout the whole paper.
If \(p=1\), then MMPVC coincides with the “mathematical programming with vanishing constraints” (MPVC) which is introduced in Achtziger and Kanzow (2008), Hoheisel and Kanzow (2007). The MPVCs received attention from different fields. Some of their applications in topological optimization and geometry have been introduced in Achtziger and Kanzow (2008), Shikhman (2012). Karush–Kuhn–Tucker (KKT)-type optimality conditions for MPVCs, named stationary conditions, are presented in some studies (see Achtziger and Kanzow 2008; Hoheisel and Kanzow 2008, 2009 and Kazemi and Kanzi 2018 for smooth and nonsmooth cases, respectively).
If \(h_i(x)g_i(x)\le 0\) is replaced by \(h_i(x)g_i(x)= 0\) for each \(i\in I\), MMPVC reduces to “multiobjective programming problem with equilibrium constraints,” (MMPEC). Stationary conditions for smooth and nonsmooth MMPECs are established under various constraint qualifications (CQ); see, e.g., (Ansari Ardali et al. 2016; Bigi et al. 2016; Movahedian 2017; Movahedian and Nobakhtian 2010) for \(p=1\), and (Luu 2016) for \(p>1\).
It is easy to see that MMPVC is a generalization of MMPEC and MPVC. To the best of our knowledge, it is not any work available dealing with stationary conditions for MMPVCs. The aim of this paper is to extend some stationary conditions for optimality of MMPVCs. In addition to classic multiobjective optimization, we can consider different kinds of optimality (efficiency) for MMPVC, including weakly efficient solution, efficient solution, strictly efficient solution, isolated efficient solution, and properly efficient solution. In this paper, we focus on properly efficient solutions for MMPVCs.
The structure of subsequent sections of this paper is as follows: In Sect. 2, we define required definitions and preliminary results which are requested in sequel. Section 3 is devoted to the main results of paper, containing some Abadie-type CQs and some kinds of necessary stationary conditions for the problem.
2 Preliminaries
This section contains some preliminary results in convex analysis from (Rockafellar 1970; Rockafellar and Wets 1998).
First, we recall that the nonnegative real numbers \([0,+\infty )\), the nonpositive real number \((-\infty ,0]\), the standard inner product of vectors \(x,y \in {\mathbb {R}}^n\), and the zero vector of \({\mathbb {R}}^n\) are, respectively, denoted by \({\mathbb {R}}_+\), \({\mathbb {R}}_-\), \(\langle x,y \rangle\), and \(0_n\).
Considering \(\varOmega \subseteq {\mathbb {R}}^n\), the negative polar cone of \(\varOmega\) is defined as
The closure, the convex cone (containing origin), and the closed convex cone of \(\varOmega\) are, respectively, denoted by \(cl(\varOmega )\), \(cone(\varOmega )\), and \(clcone(\varOmega )\). Also, the orthogonal set, contingent cone of \(\varOmega\) at \({\bar{x}} \in cl(\varOmega )\), and the Fréchet normal cone of \(\varOmega\) at \({\bar{x}}\) are, respectively, defined as
and \({\widehat{N}}_\varOmega ({\bar{x}}):=\left( \varGamma _\varOmega ({\bar{x}})\right) ^0\).
Theorem 1
(bipolar theorem Rockafellar and Wets 1998) Suppose that\(\varOmega\)is a subset on\({\mathbb {R}}^n\). Then,
Theorem 2
(Rockafellar and Wets 1998) Let \(\psi :{\mathbb {R}}^n \rightarrow {\mathbb {R}}\)be a continuously differentiablefunction at \({\bar{x}} \in \varOmega \subseteq {\mathbb {R}}^n\). If the minimum of\(\psi\)on\(\varOmega\)is attained at\({\bar{x}}\), then
Theorem 3
(Rockafellar 1970) Suppose that the linear function\(\psi :{\mathbb {R}}^n \longrightarrow {\mathbb {R}}\) is defined as \(\psi (x)=\langle z,x \rangle\) for a given \(z\in {\mathbb {R}}^n\). If\(A \subseteq {\mathbb {R}}\)is a given convex set and we define\(\psi ^{-1}\big (cl(A)\big ):=\{x\in {\mathbb {R}}^n \mid \psi (x)\in cl(A) \}\), then
Theorem 4
(Rockafellar and Wets 1998) Suppose thatLis an arbitrary index set and that\(\varOmega _{\ell } \subseteq {\mathbb {R}}^n\)is closed convex cone for each\(\ell \in L\). Then
Theorem 5
(Rockafellar 1970) Let\(\varOmega _1, \ldots ,\varOmega _k\)be closed convex cones in\({\mathbb {R}}^n\). Onemay conclude that
Let \(\varphi :{\mathbb {R}}^n \rightarrow {\mathbb {R}} \cup \{+\infty \}\) be a convex function, and \(x_0 \in dom \varphi :=\{x\in {\mathbb {R}}^n \mid \varphi (x)<+\infty \}\). The subdifferential of \(\varphi\) at \(x_0\) is defined as
It should be noted that the subdifferential set \(\partial \varphi (x_0)\) is always nonempty, compact, and convex in \({\mathbb {R}}^n\).
3 Main Results
At starting point of this section, we recall from (Geoffrion 1968; Gopfert et al. 2003) that a feasible point \({\bar{x}} \in S\) is called a properly efficient solution to MMPVC when there exist some positive scalars \(\eta _1,\ldots ,\eta _p >0\) such that
Considering a feasible point \({\hat{x}} \in S\) (this point will be fixed throughout this paper), we define the following index sets:
Following (Kazemi and Kanzi 2018), we consider two linearized cones \({\mathcal {L}}^0\) and \({\mathcal {L}}^\sharp :={\mathcal {L}}^0\cap \varLambda\) for MMPVC, where
It is worth mentioning that unlike to \({\mathcal {L}}^0\), the linearized cone \({\mathcal {L}}^\sharp\) is not convex.
Motivated by Achtziger and Kanzow (2008), Hoheisel and Kanzow (2009), Kazemi and Kanzi (2018), we define two Abadie-type constraint qualifications for MMPVC.
Definition 1
We say that MMPVC satisfies the ACQ (resp. \(ACQ_\sharp\)), if \(\varGamma _S(\hat{x})\subseteq {\mathcal {L}}^0\)\(\Big (\)resp. \(\varGamma _S(\hat{x})\subseteq {\mathcal {L}}^\sharp \Big )\).
Trivially, the following implication holds by \({\mathcal {L}}^\sharp \subseteq {\mathcal {L}}^0\),
Remark 1
We observe that \(ACQ_\sharp\) is named MPVC-ACQ in some studies; see Hoheisel and Kanzow (2009) and Kazemi and Kanzi (2018) for MPVCs with smooth and nonsmooth data, respectively. Since the concepts of ACQ and \(ACQ_\sharp\) are described and discussed in detailed manner in Hoheisel and Kanzow (2009), Kazemi and Kanzi (2018), we do not repeat that descriptions in the present article. Also, there are provided MPVC-tailored constraint qualifications which are sufficient conditions for ACQ and \(ACQ_\sharp\) in (Achtziger and Kanzow 2008. Theorems 2 and 3), (Hoheisel and Kanzow 2008, Sect. 4), and (Kazemi and Kanzi 2018, Theorem 3.1).
The following simple theorem is a normal extension of (Kazemi and Kanzi 2018, Theorem 4.1).
Theorem 6
Let\(\hat{x}\)be a properly efficient solution to MMPVC, andACQholds at\({\hat{x}}\).
- (i)
There exist some positive scalars\(\lambda ^f_j,\ j\in J\), such that
$$\begin{aligned} -\sum _{j= 1}^{p}\lambda ^f_j \nabla f_j(\hat{x}) \in clcone\big ( {\mathcal {L}}\big ). \end{aligned}$$ - (ii)
If, in addition,\(cone \big ( {\mathcal {L}}\big )\)is a closed cone, we can find some coefficients\(\lambda ^h_i\) and \(\lambda ^g_i\)as\(i\in I\), such that:
$$\begin{aligned}&\qquad \qquad 0_n\in \sum _{j= 1}^{p}\lambda ^f_j \nabla f_j(\hat{x}) +\sum _{i= 1}^{m} \Big (\lambda _{i}^{g}\partial g_{i}(\hat{x})- \lambda _{i}^{h}\partial h_{i}(\hat{x})\Big ), \end{aligned}$$(1)$$\begin{aligned}&\lambda _i^g \ge 0,\ i\in I_{+0};\qquad \ \lambda _i^g =0,\ i\in I_{0+} \cup I_{0-}\cup I_{00} \cup I_{+-};\end{aligned}$$(2)$$\begin{aligned}&\lambda _i^h \text{ is } \text{ free}, \ i\in I_{0+};\; \lambda _i^h \ge 0,\ i\in I_{0-} \cup I_{00};\qquad \ \lambda _i^h=0,\ i\in I_{+-}\cup I_{+0}. \end{aligned}$$(3)
Proof
(i) The definition of properly efficiency leads us to fine some positive scalars \(\lambda ^f_j>0\), for \(j\in J\), such that \({\hat{x}}\) is a minimizer of \(\sum _{j=1}^{p}\lambda ^f_j f_j (x)\) on S. Thus, owing to Theorem 2, we get
On the other hand, by ACQ and bipolar Theorem 1 we conclude that
This inclusion and (4) imply the result.
(ii) The structure of convex cones implies that
where,
The closedness condition, virtue of (5), and part (i) conclude the result. \(\square\)
It is worth mentioning that when \(p=1\), conditions (1)–(3) which are named “strongly stationary condition” (resp. KKT condition) (Hoheisel and Kanzow 2007; Kazemi and Kanzi 2018) (resp. Achtziger and Kanzow 2008; Hoheisel and Kanzow 2008), present an important optimality condition for MPVCs which are an appropriate alternative for classic KKT condition. Another important point of Theorem 6 is that all the coefficients \(\lambda ^f_j\) are nonzero, which guaranties the effect of each objective functions in the relation of (1); to see the theoretical significance of this topic, we can refer to (Kanzi 2015, 2018). The present paper is the first that studies this kind of stationary condition for MMPVCs.
Since \(ACQ_\sharp\) is weaker than ACQ, we cannot expect the strongly stationary condition to hold at properly efficient solution \(\hat{x}\) where \(ACQ_\sharp\) is satisfied. In the rest of this section, we get another optimality condition under \(ACQ_\sharp\), which is weaker than strongly stationary condition. Since the \(ACQ_\sharp\) is easier to happen than ACQ, this new stationary condition will be more user-friendly in applications. We observe that owing to nonconvexity of \({\mathcal {L}}_\sharp\), we cannot follow the simple strategy of Theorem 6 for giving the new stationary condition, and for achieve it, we need some preliminaries.
For each \(w\in {\mathbb {R}}^n\), \(i\in I\), and \(I_* \subseteq I\), let
The following technical lemma plays a key role in the reminder of this article.
Lemma 1
Suppose that the constraints of MMPVC with index\(i\in I_{00}\)are first written, then the constraints with index\(i\in I_{0+}\), then\(i\in I_{0-}\), then\(i\in I_{+0}\), and finally\(i\in I_{+-}\). Assume also that\(Y\subseteq {\mathbb {R}}^{2m}\)is defined as
Then, one has
Proof
Due to Theorem 4, the following equalities are fulfilled:
The definition of \(B_i(w)\) and Theorem 4 imply that, for each \(i\in I_{00}\), one has
For each \(\xi _i \in \partial g_i(\hat{x})\) and \(\zeta _i \in \partial h_i(\hat{x})\), we consider the functions \(\widehat{g}_{\xi _i},\widehat{h}_{\zeta _i}:{\mathbb {R}}^n \rightarrow {\mathbb {R}}\) as \(\widehat{g}_{\xi _i}(w):=\langle w,\xi _i \rangle\) and \(\widehat{h}_{\zeta _i}(w):=\langle w,\zeta _i \rangle\). Thus, equality (8) can be rewritten as
The last equality and Theorem 3 yield
where the last equality holds by Theorem 5.
From (9) and similar processes for \(i\in I_{0+}\), \(i\in I_{0-}\), \(i\in I_{+0}\), \(i\in I_{+-}\), we deduce that
Now, (7), (10), and Theorem 5 conclude that
where \(\lambda _i^g:=\mu _i^g\) and \(\lambda _i^h:=-\mu _i^h\), for all \(i\in I\). The proof is complete.\(\square\)
Since the negative polar of each subset of \({\mathbb {R}}^n\) is always a convex cone, Lemma 1 guaranties that \(\beth\), which is defined below, is a (not necessarily closed) convex cone in \({\mathbb {R}}^n\),
Theorem 7
Let\(\hat{x}\)be a properly efficient solution to MMPVC, and\(ACQ_\sharp\)holds at\({\hat{x}}\).
- (i)
There exist some positive scalars\(\lambda ^f_j,\ j\in J\), such that
$$\begin{aligned}&-\sum _{j= 1}^{p}\lambda ^f_j \nabla f_j(\hat{x}) \in \\&cl \Bigg [ \bigcup _{\lambda _i^g, \lambda _i^h} \bigg \{\sum _{i=1}^m \left( \lambda _i^g \partial g_i(\hat{x})-\lambda _i^h \partial h_i(\hat{x}) \right) \left| \begin{array}{ll} \lambda _i^g \ge 0,\ &{} i\in I_{00} \cup I_{+0}\\ \lambda _i^g =0,\ &{} i\in I_{0+} \cup I_{0-}\cup I_{+-}\\ \lambda _i^h \text{ is } \text{ free},\ &{} i\in I_{0+}\\ \lambda _i^h \ge 0,\ &{} i\in I_{0-} \cup I_{00}\\ \lambda _i^h=0,\ &{} i\in I_{+-}\cup I_{+0} \end{array} \right. \bigg \} \Bigg ]. \end{aligned}$$ - (ii)
If, in addition,\(\beth\)is a closed cone, we can find some coefficients\(\lambda ^h_i\)and\(\lambda ^g_i\) as \(i\in I\), such that:
$$\begin{aligned}&\qquad \qquad 0_n\in \sum _{j= 1}^{p}\lambda ^f_j \nabla f_j(\hat{x}) +\sum _{i= 1}^{m} \Big (\lambda _{i}^{g}\partial g_{i}(\hat{x})- \lambda _{i}^{h}\partial h_{i}(\hat{x})\Big ), \end{aligned}$$(11)$$\begin{aligned}&\lambda _i^g \ge 0,\ i\in I_{00} \cup I_{+0};\quad \lambda _i^g =0,\ i\in I_{0+} \cup I_{0-} \cup I_{+-}; \end{aligned}$$(12)$$\begin{aligned}&\lambda _i^h \text{ is } \text{ free}, \ i\in I_{0+};\; \lambda _i^h \ge 0,\ i\in I_{0-} \cup I_{00};\qquad \ \lambda _i^h=0,\ i\in I_{+-}\cup I_{+0}. \end{aligned}$$(13)
Proof
(i) Owing to (4), we can find some positive scalars \(\lambda ^f_j>0\) as \(j\in J\) such that
From the above inclusion and Lemma 1, it is enough to prove that
in which Y is defined as (6) and the ordering of constraints is same as considered in Lemma 1. The last inclusion is true when
We define \(\varphi (x):{\mathbb {R}}^n \longrightarrow {\mathbb {R}}^{2m}\) and \(\pi \subseteq {\mathbb {R}}^{2m}\) as
According to (Hoheisel and Kanzow 2008, Lemma 3.2), we conclude that
Thus, \(Y\subseteq \varGamma _\pi \big (\varphi (\hat{x})\big )\), and as a result
Therefore, for proving (14), it is enough to show that
To prove the above, suppose that \(\nu \in \bigg \{w\in {\mathbb {R}}^n \mid \prod _{i=1}^m B_i(w) \subseteq \varGamma _\pi \big (\varphi (\hat{x})\big )\bigg \}\) is arbitrarily chosen. Then, by (15) we have
Thus, we get
We thus proved that \(\bigg \{w\in {\mathbb {R}}^n \mid \prod _{i=1}^m B_i(w) \subseteq \varGamma _\pi \big (\varphi (\hat{x})\big )\bigg \}\subseteq {\mathcal {L}}^\sharp\). This inclusion and \(ACQ_\sharp\) assumption at \(\hat{x}\) justify (16), and the proof of (i) is complete. (ii) follows from (i) and closedness assumption of \(\beth\).\(\square\)
It is worth mentioning that when \(p=1\), conditions (11)–(13) are referred by “VC stationary condition” in Hoheisel and Kanzow (2008), Kazemi and Kanzi (2018). Clearly, the VC stationary condition is weaker than strongly stationary condition.
References
Achtziger W, Kanzow C (2008) Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications. Math Progr 114:69–99
Ansari Ardali A, Movahedian N, Nobakhtian S (2016) Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators. Optimization 65:67–85
Bigi G, Pappalardo M, Passacantando M (2016) Optimization tools for solving equilibrium problems with nonsmooth data. J Optim Theory Appl 171:887–905
Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. Math Anal Appl 22:618–630
Gopfert A, Riahi H, Tammer C, Zalinescu C (2003) Variational methods in partially ordered spaces. Springer, New York
Hoheisel T, Kanzow C (2007) First- and second-order optimality conditions for mathematical programs with vanishing constraints. Appl Math 52:495–514
Hoheisel T, Kanzow C (2008) Stationarity conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J Math Anal Appl 337:292–310
Hoheisel T, Kanzow C (2009) On the Abadie and Guignard constraint qualifications for mathematical programs with vanishing constraints. Optimization 58:431–448
Kanzi N (2015) Karush-Kuhn-Tucker types optimality conditions for non-smooth semi-infinite vector optimization problems. J Math Ext 9:45–56
Kanzi N (2018) Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems. Iran J Sci Technol Trans Sci. https://doi.org/10.1007/s40995-017-0156-6
Kazemi S, Kanzi N (2018) Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints. J Optim Theory Appl. https://doi.org/10.1007/s10957-018-1373-7
Luu DV (2016) Optimality condition for local efficient solutions of vector equilibrium problems via convexificators applications. J Optim Theory Appl 171:643–665
Movahedian N (2017) Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints. J Global Optim 67:829–850
Movahedian N, Nobakhtian S (2010) Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints. Nonlinear Anal 72:2694–2705
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
Rockafellar RT, Wets B (1998) Variational analysis. Springer, Berlin
Shikhman V (2012) Topological aspects of nonsmooth optimization. Springer, London
Acknowledgements
The authors are very grateful to the referees for carefully reading the paper and for their helpful and constructive comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ardakani, J.S., Rad, S.F., Kanzi, N. et al. Necessary Stationary Conditions for Multiobjective Optimization Problems with Nondifferentiable Convex Vanishing Constraints. Iran J Sci Technol Trans Sci 43, 2913–2919 (2019). https://doi.org/10.1007/s40995-019-00768-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40995-019-00768-4
Keywords
- Stationary conditions
- Multiobjective optimization
- Abadie constraint qualification
- Vanishing constraints.