- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

The Scientific World Journal

Volume 2013 (2013), Article ID 403642, 6 pages

http://dx.doi.org/10.1155/2013/403642

*ϵ*-Henig Saddle Points and Duality of Set-Valued Optimization Problems in Real Linear Spaces

College of Mathematics and Statistics, Chongqing University of Technology, Chongqing 400054, China

Received 8 August 2013; Accepted 5 September 2013

Academic Editors: P. Branchini and V. Kazukauskas

Copyright © 2013 Zhi-Ang Zhou. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We study *ϵ*-Henig saddle points and duality of set-valued optimization problems in the setting of real linear spaces. Firstly, an equivalent characterization of *ϵ*-Henig saddle point of the Lagrangian set-valued map is obtained. Secondly, under the assumption of the generalized cone subconvexlikeness of set-valued maps, the relationship between the *ϵ*-Henig saddle point of the Lagrangian set-valued map and the *ϵ*-Henig properly efficient element of the set-valued optimization problem is presented. Finally, some duality theorems are given.

#### 1. Introduction

Saddle points and duality of set-valued optimization, which have close relationship to the generalized convexity of set-valued maps and the efficiency of solutions of set-valued optimization, are two important topics in optimization theory. Recently, many new researches involving saddle points and duality of set-valued optimization have appeared in the literature. Li [1] introduced Benson proper saddle point of the Lagrangian set-valued maps for a set-valued optimization problem in locally convex spaces and established saddle point theorems and duality theorems under the assumption of the cone subconvexlikeness of set-valued maps. Zhao and Rong [2] and Li et al. [3] investigated -strict saddle points and duality of set-valued optimization problems under the assumption of cone convexlikeness and ic-cone convexlikeness of set-valued maps, respectively. Xia and Qiu [4] obtained saddle point theorems and duality theorems of set-valued optimization problems in the sense of super efficiency under the nearly subconvexlikeness of set-valued maps.

However, in the above mentioned references, saddle points and duality of set-valued optimization were studied in locally convex spaces. How to generalize saddle point theorems and duality theorems of set-valued optimization from locally convex spaces to linear spaces is interesting. Adán and Novo [5] studied saddle points and duality for convexlike vector optimization problems in real linear spaces. In the -global prober efficiency, Zhou et al. [6] introduced the concept of the -global prober saddle point and obtained the relationships between the -global proper saddle points of Lagrangian set-valued maps and the-global properly efficient element of set-valued optimization problems.

This paper is a continuation of the research work [7]. The aim of this paper is to investigate -Henig proper saddle points and duality of set-valued optimization problems in linear spaces. This paper is organized as follows. In Section 2, some preliminaries, including notations and lemmas, are given. In Section 3, we introduce a new notion of -Henig proper saddle point of the Lagrangian set-valued map in linear spaces and obtain several saddle point theorems. In Section 4, we present three duality theorems including -weak duality, -converse duality, and -strong duality.

#### 2. Preliminaries

Let be a real linear space, and let and be two real ordered linear spaces. denotes the zero element of every space. Let be a nonempty subset in . The generated cone of is defined as . is called a cone if and only if for any . A cone is said to be pointed if and only if is said to be nontrivial if and only if and .

The algebraic dual of and is denoted by and , respectively. Let and be two nontrivial pointed convex cones in and , respectively. The algebraic dual cone and strictly algebraic dual cone of are, respectively, defined as where denotes the value of the linear functional at the point . The meaning of is similar to that of .

*Definition 1 (see [8]). *Let be a nonempty subset in . The algebraic interior of is the set

*Definition 2 (see [9]). *Let be a nonempty subset in . is balanced if and only if, for all, for all . is called absorbent if and only if .

*Definition 3 (see [10]). *Let be a nonempty subset in . The vector closure of is the set

Following Adán and Novo [10], is vectorially closed (v-closed) if .

*Definition 4 (see [7]). *Letbe a nonempty convex subset in . is a base of if and only if and there exists a balanced, absorbent, and convex set such that in . Write .

From now on, we suppose that and is a base of . We recall a notion of-Henig properly efficient point introduced by Zhou et al. [7] in linear spaces.

*Definition 5 (see [7]). *Let and . is called an -Henig properly minimal efficient point with respect to (denoted by -) if and only if there exists a balanced, absorbent, and convex set with such that is called an -Henig properly maximal efficient point with respect to(denoted by ) if and only if there exists a balanced, absorbent, and convex set with such that .

Let be a nonempty set in and and be two set-valued maps on . Write , and . The meanings of , and are similar to those of , and , respectively.

*Definition 6 (see [11]). *A set-valued map is called generalized -subconvexlike on if and only if is a convex set in .

Lemma 7 (see [6]). *Let be a linear space, and let be two nonempty sets such that is a convex set in . If and , then there exists such that .*

#### 3. -Henig Saddle Points

In this section, we will establish approximate saddle point theorems of set-valued optimization problems in the sense of -Henig proper efficiency.

Let and be two set-valued maps on . We consider the following vector optimization problem with set-valued maps: The feasible set of (VP) is defined by

*Definition 8 (see [7]). *Let . is called an -Henig properly efficient solution of (VP) if and only if there exists such that -. The pair is called an -Henig properly efficient element of (VP).

We denote by the set of all linear operators from to . A subset of is defined as . The Lagrangian set-valued map of (VP) is defined by

Consider the following unconstrained vector optimization problem with set-valued maps:

Lemma 9 (see [7]). *Let , , and . If there exists such that is an -Henig properly efficient element of , then is an -Henig properly efficient element of (VP).*

Now, we will introduce a new notion called -Henig proper saddle point of the Lagrangian set-valued map in linear spaces.

*Definition 10. * is called an-Henig proper saddle point of the Lagrangian set-valued map if and only if

The following proposition is an important equivalent characterization for an-Henig proper saddle point of the Lagrangian set-valued map .

Proposition 11. *Let be v-closed and . Then, is an-Henig proper saddle point of the Lagrangian set-valued map if and only if there exist , , and a balanced, absorbent, and convex set with such that *(i)*;*(ii)*;*(iii)*;*(iv)*.*

* Proof. **Necessity*. Let be an -Henig proper saddle point of . Then, there exist and such that
Equation (8) shows that (i) holds. By (9), there exists a balanced, absorbent, and convex set with such that
Taking in (10), we obtain
Therefore, (iv) holds. Since and is absorbent in , it follows from (11) that
Because , it follows from (12) that . Clearly, . Therefore,
We assert that . Otherwise, by Lemma 7, it is easy to prove (see the proof of Proposition 4.1 in [6]) that there exists such that . Taking , we define a vector-valued map as follows:
Clearly, and . On the other hand, . Since . Therefore,
which contradicts (10). Hence,. Since , we have
It follows from (13) and (16) that (iii) holds. We assert that . Otherwise, there exists such that . Similar to the above proof, there exists such that . Taking , we define a vector-valued map as follows:
Clearly,
Since and , it follows from (10) and (18) that
By (20), it is easy to check that , which contradicts (19). Therefore, (ii) holds.*Sufficiency*. Since , by condition (i), we only prove that
We assert
Otherwise, there exists , , , , , , and such that . Clearly,
By condition (ii), . Since , . Therefore, there exist and such that
It follows from (23) and (24) that
Since , it follows from the balance ofthat
It follows from the convexity of that
Since and , it follows from (25)–(27) that
which contradicts condition (iv). Therefore, (22) holds. Thus, (21) holds.

*Remark 12. * According to Theorem 1 in [12], the notion of -strictly efficient point is equivalent to the notion of -Henig properly efficient point in locally convex spaces. Moreover, the generalized subconvexlikeness of the set-valued map is equivalent to ic-cone convexlikeness of the set-valued map introduced by Sach [13] when the topological interior . Therefore, Proposition 11 generalizes Proposition 5.1 in [3] from locally convex spaces to real linear spaces.

Theorem 13. *Let be v-closed and . If is an -Henig proper saddle point of the Lagrangian set-valued map , then there exist and such that is an -Henig properly efficient element of (VP), where . *

* Proof. *Since is an -Henig proper saddle point of the Lagrangian set-valued map , it follows from Proposition 11 that there exist , , and a balanced, absorbent, and convex set with such that conditions (i)–(iv) hold. By condition (ii), . By condition (iii), . We assert that is an -Henig properly efficient element of (VP). Otherwise, for any balanced, absorbent, and convex set with . Therefore, there exist , , , , , and such that
It follows from (29) that
Since , for any , it follows from (30) that there exists such that
Because is a base of , there exist and such that . By (31), we obtain
Clearly, . Therefore, we obtain
which contradicts -. Hence, is an -Henig properly efficient element of (VP).

*Remark 14. * Comparing Theorem 13 with Theorem 4.1 in [6], the notion of -global proper efficiency has been replaced by the notion of -Henig proper efficiency and the condition has been dropped.

In order to obtain sufficient conditions of-Henig proper saddle point under the assumption of the generalized cone subconvexlikeness, we need the following lemma.

Lemma 15 (see [7]). *Let , , and . Suppose that the following conditions hold: *(i)* is an -Henig properly efficient element of (VP); *(ii)* is generalized -subconvexlike on , where ;*(iii)*. ** Then, there exists such that is an-Henig properly efficient element of .*

By Lemma 15, we easily obtain the following theorem involving the generalized cone subconvexlikeness of set-valued maps.

Theorem 16. *Let be v-closed, , , and . Suppose that the following conditions hold: *(i)* is an-Henig properly efficient element of (VP); *(ii)* is generalized -subconvexlike on , where ; *(iii)*; *(iv)*-. ** Then, there exists such that is an -Henig proper saddle point of.*

#### 4. -Duality

In this section, we will give several duality theorems characterized by -Henig proper efficiency of set-valued optimization problems in linear spaces.

*Definition 17. *Let and let be a base of . The set-valued map , defined by -, is called an -Henig properly dual map of (VP).

Now, we construct the following duality problem of the primal problem (VP):

*Definition 18. *Let . is called an-efficient point of (VD) if and only if

Theorem 19 (-weak duality). *Let , , and . Then, . *

* Proof. *Since , there exists such that . Clearly, -. Thus, there exists a balanced, absorbent, and convex set with such that . It is easy to check . Therefore, . Since . Because , there exists such that . Since , it is easy to check that .

Theorem 20 (-converse duality). *Let and. If and , then is an -Henig properly efficient element of (VP) and is -efficient point of (VD). *

* Proof. * Since , there exists such that . It follows from and the definition ofthatis an-Henig properly efficient element of . According to Lemma 9,is an-Henig properly efficient element of (VP). Because and , using Theorem 19, we have . Clearly, . Therefore, is -efficient point of (VD).

Theorem 21 (-strong duality). *Let , and . Suppose that the following conditions hold: *(i)* is an-Henig properly efficient element of (VP); *(ii)* is generalized -subconvexlike on , where ; *(iii)*. ** Then,is-efficient point of (VD). *

* Proof. * According to Lemma 15, there exists such that is an-Henig properly efficient element of . Since , we have
Since, it follows from Theorem 19 that is -efficient point of (VD).

#### 5. Conclusions

Based on [7], we introduce the concept of -Henig saddle point of the set-valued map in linear spaces. The relationships between the -Henig saddle point of the set-valued map and the -Henig properly efficient element of the set-valued optimization problem are established. Some duality theorems are obtained in the sense of -Henig proper efficiency. When -Henig proper efficiency is replaced by -super efficiency in linear spaces, whether the conclusions of this paper hold is an interesting topic.

#### Acknowledgments

This work was supported by the National Nature Science Foundation of China (11271391), the Natural Science Foundation of Chongqing (CSTC 2011jjA00022), and the Science and Technology Project of Chongqing Municipal Education Commission (KJ130830).

#### References

- Z. F. Li, “Benson proper efficiency in the vector optimization of set-valued maps,”
*Journal of Optimization Theory and Applications*, vol. 98, no. 3, pp. 623–649, 1998. View at Scopus - C. Y. Zhao and W. D. Rong, “Optimality conditions for set-valued optimization in the sense of
*ϵ*-strict efficiency,”*Operations Research Transactions*, vol. 12, no. 4, pp. 10–18, 2008. - T. Li, Y. Xu, and C. Zhu, “
*ϵ*-strictly efficient solutions of vector optimization problems with set-valued maps,”*Asia-Pacific Journal of Operational Research*, vol. 24, no. 6, pp. 841–854, 2007. View at Publisher · View at Google Scholar · View at Scopus - L. Y. Xia and J. H. Qiu, “Super efficiency in vector optimization with nearly subconvexlike set-valued maps,”
*Journal of Optimization Theory and Applications*, vol. 136, no. 1, pp. 125–137, 2008. View at Publisher · View at Google Scholar · View at Scopus - M. Adán and V. Novo, “Duality and saddle points for convexlike vector optimization problems on real linear spaces,”
*Top*, vol. 13, no. 2, pp. 343–357, 2005. View at Publisher · View at Google Scholar - Z.-A. Zhou, X.-M. Yang, and J.-W. Peng, “
*ϵ*-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces,”*Optimization Letters*, 2013. View at Publisher · View at Google Scholar - Z.-A. Zhou, X.-M. Yang, and J.-W. Peng, “
*ϵ*-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces,”*Optimization Letters*, 2013. View at Publisher · View at Google Scholar - J. Jahn,
*Vector Optimization: Theory, Applications and Extensions*, Springer, Berlin, Germany, 2nd edition, 2011. - S. Z. Shi,
*Convex Analysis*, Shanghai Science and Technology Press, Shanghai, China, 1990. - M. Adán and V. Novo, “Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness,”
*European Journal of Operational Research*, vol. 149, no. 3, pp. 641–653, 2003. View at Publisher · View at Google Scholar · View at Scopus - Y. W. Huang and Z. M. Li, “Optimality condition and Lagrangian multipliers of vector optimization with set-valued maps in linear spaces,”
*Operations Research Transactions*, vol. 5, no. 1, pp. 63–69, 2001. - J. H. Qiu and S. Y. Zhang, “Strictly efficient points and Henig properly efficient points,”
*Journal of Mathematics*, vol. 25, pp. 203–209, 2005. - P. H. Sach, “New generalized convexity notion for set-valued maps and application to vector optimization,”
*Journal of Optimization Theory and Applications*, vol. 125, no. 1, pp. 157–179, 2005. View at Publisher · View at Google Scholar · View at Scopus