Abstract
In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types of the problem (SP) under -cone arcwise connectedness assumptions.
MSC:
26B25; 49N15
1. Introduction
Over the last few decades, many authors, such as Hanson [1], Craven [2], Corley [3], Zalmai [4] etc., studied different types of optimization problems. One of such optimization problems is semi-infinite programming problem. In recent times, many authors, such as Goberna and Lopez [5], Shapiro [6], etc., have studied optimality conditions of semi-infinite programming problems. In 2005, Shapiro [7] studied the Lagrangian-type duality of semi-infinite programming problems under convexity assumption. In 2010, Kostyukova and Tchemisova [8] established sufficient optimality conditions of semi-infinite programming problems using convexity assumption. In 2012, Mishra and Jaiswal [9] established the sufficient optimality conditions of semi-infinite programming problems using generalized convexity assumption. They also formulated duality model and proved the corresponding theorems of Mond–Weir type dual.
In 1976, Avriel [10] introduced the notion of arcwise connectedness as a generalization of convexity. It was basically introduced by replacing the line segment and joining two points by a continuous arc. Later, Fu and Wang [11] and Lalitha et al. [12] introduced the notion of cone arcwise connected set-valued maps as an extension of the class of convex set-valued maps. Lalitha et al. [12] established the sufficient optimality conditions of set-valued optimization problems via contingent epiderivative and cone arcwise connectedness assumptions. In 2013, Yu [13] established the necessary and sufficient optimality conditions for the existence of global proper efficient points of vector optimization problems using cone arcwise connectedness. Yihong and Min [14] introduced the concept of -order nearly cone arcwise connected set-valued maps and derived the necessary and sufficient optimality conditions of some set-valued optimization problems. Yu [15] established the necessary and sufficient optimality conditions for the existence of global proper efficient elements in vector optimization problems. In 2018, Peng and Xu [16] introduced the notion of cone subarcwise connected set-valued maps. They also established the second-order necessary optimality conditions for global proper efficiency of set-valued optimization problems.
In this paper, we consider a set-valued semi-infinite programming problem (SP), where the objective function and constraints are set-valued maps. We are mainly interested in establishing the sufficient KKT optimality conditions of the problem (SP) in terms of generalized cone arcwise connectedness. We also study the duality theorems of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types associated with the problem (SP).
This paper is organized as follows. In Section 2, we state some definitions and preliminary concepts of set-valued maps. The concept of -cone arcwise connectedness is included in Section 3. In Section 4, we establish (see Section 5) the sufficient KKT optimality conditions for the problem (SP). We also study the duality results of various types using generalized cone arcwise connectedness assumptions (see Section 6, Section 7 and Section 8). Section 9 concludes the paper.
2. Definitions and Preliminaries
Let V be a real normed space and be a nonempty subset of V. Then, is said to be a cone if , for all and . Furthermore, is called non-trivial if , proper if , pointed if , solid if int, closed if , and convex if , for all , where int and denote the interior and closure of , respectively, and is the zero element of V.
Aubin [17,18] introduced the notion of contingent cone in set-valued optimization theory. Moreover, Aubin [17,18] and Cambini et al. [19] introduced the notion of second-order contingent set in a set-valued optimization theory.
Definition 1 ([17,18]).
Let V be a real normed space, , and . The contingent cone to B at is denoted by and is defined as follows: an element if there are sequences in , with and in V, with , such that
or, there exist sequences in , with and in B, with , such that
Let U, V be real normed spaces, be the set of all subsets of V, and be a solid pointed convex cone in V. Let be a set-valued map from U to V, i.e., , for all . The domain, image, graph, and epigraph of are defined by
and
Jahn and Rauh [20] introduced the notion of contingent epiderivative of set-valued maps. It plays a vital role in various aspects of set-valued optimization problems.
Definition 2 ([20]).
A single-valued map whose epigraph coincides with the contingent cone to the epigraph of at , i.e.,
is said to be the contingent epiderivative of at .
We now turn our attention to the notion of cone convexity of set-valued maps which was introduced by Borwein [21] in 1977.
Definition 3 ([21]).
Let A be a nonempty convex subset of a real normed space U. A set-valued map , with , is called Ω-convex on A if and ,
In 1976, Avriel [10] introduced the notion of arcwise connectedness of set-valued maps.
Definition 4.
A subset A of a real normed space U is said to be an arcwise connected set if for all there is a continuous arc defined on with a value in A such that and .
Fu and Wang [11] and Lalitha et al. [12] introduced the notion of cone arcwise connectedness of set-valued maps. It is basically an extension of the class of cone convex set-valued maps.
Definition 5 ([11,12]).
Let A be an arcwise connected subset of a real normed space U and be a set-valued map, with . Then, is said to be Ω-arcwise connected on A if
Peng and Xu [16] introduced the notion of cone subarcwise connectedness of set-valued maps.
Definition 6 ([16]).
Let A be an arcwise connected subset of a real normed space U, , and be a set-valued map, with . Then, is said to be Ω-subarcwise connected on A if
3. -Cone Arcwise Connectedness
Das and Nahak [22,23,24,25] and Treanţă and Das [26] introduced the notion of -cone convexity of set-valued maps. They establish the sufficient KKT optimality conditions of set-valued optimization problems under contingent epiderivative and -cone convexity assumptions. They also construct various duality models and prove the associated duality theorems. For , we get the usual notion of cone convexity of set-valued maps introduced by Borwein [21] in the year of 1977.
We introduce the notion of -cone arcwise connectedness of set-valued maps as a generalization of cone arcwise connected set-valued maps.
Definition 7.
Let A be an arcwise connected subset of a real normed space U, , and be a set-valued map, with . Then, is said to be ρ-Ω-arcwise connected on A with respect to e if there exists , such that
Remark 1.
If , then is called strongly ρ-Ω-arcwise connected; if , we have the notion of Ω-arcwise connectedness; and if , then is called weakly ρ-Ω-arcwise connected. Obviously, strongly ρ-Ω-arcwise connectedness ⇒Ω-arcwise connectedness ⇒ weakly ρ-Ω-arcwise connectedness.
Further, we formulate an example of -cone arcwise connected set-valued map, which is not cone arcwise connected.
Example 1.
Let and
Define , where , and . Clearly, A is an arcwise connected set. For the set-valued map , defined as follows: , , and for , we find that is not Ω-arcwise connected for and . On the other hand, by considering and , we get that is a ρ-Ω-arcwise connected set-valued map for .
Theorem 1.
Let A be an arcwise connected subset of a real normed space U, , and be ρ-Ω-arcwise connected on A with respect to e. Let and . Then,
where
assuming that exists for all .
Proof.
Let . As is --arcwise connected on A with respect to e, we have
Let . Consider a real sequence , with , , such that when . Suppose
and
Therefore,
It is clear that
and
Therefore,
Consequently,
which is true, for all . Hence,
Hence, the theorem follows. □
4. Formulation of the Main Problem
Let U be a countably infinite subset of , , and , be two set-valued maps with
Let be positive semi-definite symmetric real matrices. We consider a set-valued semi-infinite programming problem (SP).
We define the feasible set of the problem (SP) by
Definition 8.
A point , with and , is said to be a minimizer of the problem (SP) if for all , with and ,
Definition 9.
A point , with and , is said to be a weak minimizer of the problem (SP) if for all , with and ,
Let J be the index set, such that . Let . We denote a set by
We assume that .
For special case, when and are single-valued maps, we can have multiobjective semi-infinite programming problem ([9]) as
by considering , , and in the problem (SP).
5. Optimality Conditions
Let , . Define maps , , by
The gradient vector of , denoted by , is given by
Let and . Define a set-valued map by
We establish the sufficient KKT optimality conditions of the set-valued semi-infinite programming problem (SP) under -cone arcwise connectedness assumption.
Theorem 2 (Sufficient optimality conditions).
Let A be an arcwise connected subset of , , and . Let , and , with . Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A with respect to 1. Further, we suppose that the contingent epiderivatives and exist. If there exist , , and , , with , for finitely many j, and
satisfying the following conditions
and
Then, is a weak minimizer of (SP).
Proof.
Let be not a weak minimizer of (SP). Then there exist and , such that
As , we have
Since , , is --arcwise connected on A with respect to 1 and , we have
Hence,
Therefore,
Again, as , and , , are --arcwise connected and --arcwise connected, respectively, on A, with respect to 1, we have
and
As , there exists . So, we have
Therefore,
and
From (7)–(9), we have
From (1), we have
As and , , we have
Hence,
Using the generalized Schwarz inequality, we have
Again, from (5), we have
Therefore,
From (4), we have . So, we have
Hence,
which contradicts (6). Hence, is a weak minimizer of (SP). □
6. Mond–Weir Type Dual
We consider the Mond–Weir type dual (MWD) of the problem (SP), where and are contingent epiderivable set-valued maps:
Definition 10.
A feasible point of (MWD) is said to be a weak maximizer of (MWD) if for all feasible points of (MWD),
where .
Theorem 3 (Weak duality).
Let A be an arcwise connected subset of and be an element of the feasible set S of (SP). Let be a feasible solution of (MWD). Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (5 1). Further, we suppose that the contingent epiderivatives and exist. Then,
Proof.
Assume that there is point , , such that
As , we have
As , , is --arcwise connected on A with respect to 1 and , we have
Hence,
Therefore,
As , , is --arcwise connected on A with respect to 1, we have
Therefore,
Again, as , , is --arcwise connected on A with respect to 1 and , , we have
As , there exists , , we have
Hence,
From (11)–(13), we have
From (1), we have
As , , and , , we have
Hence,
Using the generalized Schwarz inequality, we have
Again, from the constraints of (MWD), we have
Hence, . It shows that
which contradicts (10). Therefore,
Hence,
It completes the proof of the theorem. □
Theorem 4 (Strong duality).
Suppose that is a weak minimizer of (SP), , , and . Suppose that, for some , , with and , with for finitely many and , . Equations (5.2)–(5.5) are satisfied at the point . Then, is a feasible solution of (MWD). If the Theorem 6.1 holds between the problems (SP) and (MWD), then is a weak maximizer of (MWD).
Proof.
As (2)–(5) are satisfied at the point , we have
and
Hence, is a feasible solution of (MWD). Assume that the weak duality Theorem 3 holds between the problems (SP) and (MWD). Let be not a weak maximizer of (MWD). Then, there exists a feasible solution of (MWD), such that
where . As , , we have
which contradicts the Theorem 3 between (SP) and (MWD). Hence, is a weak maximizer of (MWD). □
Theorem 5 (Converse duality).
Let A be an arcwise connected subset of . Suppose that is a feasible solution of (MWD), with
Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). We suppose that the contingent epiderivatives and exist. If , then is a weak minimizer of (SP).
Proof.
Let be not a weak minimizer of (SP). Then, and exist, such that
As , we have
Since , , is --arcwise connected on A with respect to 1 and , we have
Hence,
Therefore,
Again, as , , and , , are --arcwise connected and --arcwise connected, respectively, on A, with respect to 1, we have
and
As , there exists , . So,
Therefore,
and
From (15)–(17), we have
By (1), we have
As , , and , , we have
Hence,
From the generalized Schwarz inequality, we have
Again, by assumption, we have
Therefore,
As , (from the constraints of (MWD)), we have
Hence,
which contradicts (14). So, is a weak minimizer of (SP). □
7. Wolfe Type Dual
We consider the Wolfe type dual (WD) of the problem (SP), where and are contingent epiderivable set-valued maps:
Definition 11.
A feasible point of (WD) is said to be a weak maximizer of (WD) if for all feasible points of (WD),
where .
We can prove the duality theorems of Wolfe type associated with the problem (SP). The proofs are very similar to Theorems 3–5, and hence we omit it.
Theorem 6 (Weak duality).
Let A be an arcwise connected subset of and . Let be a feasible solution of (WD). Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). Suppose that the contingent epiderivatives and exist. Then,
Theorem 7 (Strong duality).
Suppose that is a weak minimizer of (SP), , , and . Suppose that for some , , with and , with for finitely many and , , Equations (2)–(5) are satisfied at the point . Then, is a feasible solution of (WD). If the Theorem 6 holds between the problems (SP) and (WD), then is a weak maximizer of (WD).
Theorem 8 (Converse duality).
Let A be an arcwise connected subset of . Suppose that is a feasible solution of (WD), with
and
Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). We suppose that the contingent epiderivatives and exist. If , then is a weak minimizer of (SP).
8. Mixed Type Dual
We consider the mixed type dual (MD) of the problem (SP), where and are contingent epiderivable set-valued maps:
Definition 12.
A feasible point of (MD) is said to be a weak maximizer of (MD) if for all feasible points of (MD),
where .
We develop the duality results of mixed type of the problem (SP). The proofs are very similar to Theorems 3–5, and hence we omit it.
Theorem 9 (Weak duality).
Let A be an arcwise connected subset of and . Let be a feasible solution of (MD). Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). Let the contingent epiderivatives and exist. Then,
Theorem 10 (Strong duality).
Suppose that is a weak minimizer of (SP), , , and . Suppose that for some , , with and , with for finitely many and , . Equations (2)–(5) are satisfied at the point . Then, is a feasible solution of (MD). If the Theorem 9 holds between the problems (SP) and (MD), then
is a weak maximizer of (MD).
Theorem 11 (Converse duality).
Let A be an arcwise connected subset of . Suppose that is a feasible solution of (MD), with . Let , for and . Suppose that , , , and , , are --arcwise connected, --arcwise connected, and --arcwise connected set-valued maps, respectively, on A, with respect to 1, satisfying (1). We suppose that the contingent epiderivatives and exist. If , then is a weak minimizer of (SP).
9. Conclusions
In this paper, we have established the sufficient KKT optimality conditions of a set-valued semi-infinite programming problem (SP) under -cone arcwise connectedness assumptions. We studied the duality theorems of Mond–Weir, Wolfe, and mixed types associated with the problem (SP).
Author Contributions
Conceptualization, K.D.; methodology, K.D. and S.T.; validation, K.D. and S.T. All authors have read and agreed to the published 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
The authors would like to thank anonymous referees for their careful reading.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Hanson, M.A. On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 1981, 80, 545–550. [Google Scholar] [CrossRef]
- Craven, B.D. Invex functions and constrained local minima. Bull. Austral. Math. Soc. 1981, 24, 357–366. [Google Scholar] [CrossRef]
- Corley, H.W. Existence and Lagrangian duality for maximizations of set-valued functions. J. Optim. Theory Appl. 1987, 54, 489–501. [Google Scholar] [CrossRef]
- Zalmai, G.J. Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities. J. Math. Anal. Appl. 1990, 153, 331–355. [Google Scholar] [CrossRef]
- Goberna, M.A.; Lopez, M.A. Linear semi-infinite programming theory: An updated survey. Eur. J. Oper. Res. 2002, 143, 390–405. [Google Scholar] [CrossRef]
- Shapiro, A. Semi-infinite programming, duality, discretization and optimality condition. Optimization 2009, 58, 133–161. [Google Scholar] [CrossRef]
- Shapiro, A. On duality theory of convex semi-infinite programming. Optimization 2005, 54, 535–543. [Google Scholar] [CrossRef][Green Version]
- Kostyukova, O.I.; Tchemisova, T.V. Sufficient optimality conditions for convex semi-infinite programming. Optim. Methods Softw. 2010, 25, 279–297. [Google Scholar] [CrossRef]
- Mishra, S.K.; Jaiswal, M. Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming. Vietnam J. Math. 2012, 40, 331–343. [Google Scholar]
- Avriel, M. Nonlinear Programming: Theory and Method; Prentice-Hall: Englewood Cliffs, NJ, USA, 1976. [Google Scholar]
- Fu, J.; Wang, Y. Arcwise connected cone-convex functions and mathematical programming. J. Optim. Theory Appl. 2003, 118, 339–352. [Google Scholar] [CrossRef]
- Lalitha, C.; Dutta, J.; Govil, M.G. Optimality criteria in set-valued optimization. J. Aust. Math. Soc. 2003, 75, 221–232. [Google Scholar] [CrossRef]
- Yu, G. Optimality of global proper efficiency for cone-arcwise connected set-valued optimization using contingent epiderivative. Asia-Pac. J. Oper. Res. 2013, 30, 1340004. [Google Scholar] [CrossRef]
- Yihong, X.; Min, L. Optimality conditions for weakly efficient elements of set-valued optimization with α-order near cone-arcwise connectedness. J. Syst. Sci. Math. Sci. 2016, 36, 1721. [Google Scholar]
- Yu, G. Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps. Numer. Algebra Control Optim. 2016, 6, 35. [Google Scholar] [CrossRef]
- Peng, Z.; Xu, Y. Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems. Acta Math. Appl. Sin. Engl. Ser. 2018, 34, 183–196. [Google Scholar] [CrossRef]
- Aubin, J.P. Contingent derivatives of set-valued maps and existence of solutions to nonlinear inclusions and differential inclusions. In Mathematical Analysis and Applications, Part A; Nachbin, L., Ed.; Academic Press: New York, NY, USA, 1981; pp. 160–229. [Google Scholar]
- Aubin, J.P.; Frankowska, H. Set-Valued Analysis; Birhäuser: Boston, MA, USA, 1990. [Google Scholar]
- Cambini, A.; Martein, L.; Vlach, M. Second order tangent sets and optimality conditions. Math. Jpn. 1999, 49, 451–461. [Google Scholar]
- Jahn, J.; Rauh, R. Contingent epiderivatives and set-valued optimization. Math. Method Oper. Res. 1997, 46, 193–211. [Google Scholar] [CrossRef]
- Borwein, J. Multivalued convexity and optimization: A unified approach to inequality and equality constraints. Math. Program. 1977, 13, 183–199. [Google Scholar] [CrossRef]
- Das, K.; Nahak, C. Approximate quasi efficiency of set-valued optimization problems via weak subdifferential. SeMA J. 2017, 74, 523–542. [Google Scholar] [CrossRef]
- Das, K.; Nahak, C. Set-valued minimax programming problems under generalized cone convexity. Rend. Circ. Mat. Palermo 2017, 66, 361–374. [Google Scholar] [CrossRef]
- Das, K.; Nahak, C. Sufficiency and duality of set-valued semi-infinite programming problems under generalized cone convexity. Acta Univ. Matthiae Belii Ser. Math. 2020, 2020, 95–111. [Google Scholar]
- Das, K.; Nahak, C. Set-valued optimization problems via second-order contingent epiderivative. Yugosl. J. Oper. Res. 2021, 31, 75–94. [Google Scholar] [CrossRef]
- Treanta, S.; Das, K. On robust saddle-point criterion in optimization problems with curvilinear integral functionals. Mathematics 2021, 9, 1790. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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/).