Abstract and Applied Analysis

Volume 2014 (2014), Article ID 317304, 7 pages

http://dx.doi.org/10.1155/2014/317304

Research Article

On Nonsmooth Semi-Infinite Minimax Programming Problem with -Invexity

X. L. Liu,¹ G. M. Lai,² C. Q. Xu,³ and D. H. Yuan¹

¹Department of Mathematics, Hanshan Normal University, Guangdong 521041, China

²Department of Computer Science, Hanshan Normal University, Guangdong 521041, China

³Science College, Beijing University of Civil Engineering and Architecture, Beijing 102616, China

Received 29 August 2013; Accepted 12 January 2014; Published 4 March 2014

Academic Editor: Josip E. Pečarić

Copyright © 2014 X. L. Liu et al. 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 are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem. Under the Lipschitz -invexity assumptions, we derive the sufficiency of the necessary optimality conditions for the same problem. We also formulate dual and establish weak, strong, and strict converse duality theorems for Problem (SIP) and its dual. These results extend several known results to a wider class of problems.

1. Introduction

Convexity plays a central role in many aspects of mathematical programming including analysis of stability, sufficient optimality conditions, and duality. Based on convexity assumptions, nonlinear programming problems can be solved efficiently. There have been many attempts to weaken the convexity assumptions in order to treat many practical problems. Therefore, many concepts of generalized convex functions have been introduced and applied to mathematical programming problems in the literature [1]. One of these concepts, invexity, was introduced by Hanson in [2]. Hanson has shown that invexity has a common property in mathematical programming with convexity that Karush-Kuhn-Tucker conditions are sufficient for global optimality of nonlinear programming under the invexity assumptions. Ben-Israel and Mond [3] introduced the concept of preinvex functions which is a special case of invexity. Many other concepts of generalized convexity such as -invexity [4], -convexity [5], -convexity [6], -convexity [7], and -invexity [8] have also been introduced. With these definitions of generalized invexity on the hand, several authors have been interested recently in the optimality conditions and duality results for different classes of minimax programming problems; see [9–12] for details.

Recently, Antczak and Stasiak [13] generalized the definition of -invexity notion introduced by Caristi et al. and M. V. Ştefănescu and A. Ştefănescu [14, 15] for differentiable optimization problems to the case of mathematical programming problems with locally Lipschitz functions. They proved sufficient optimality conditions and duality results for nondifferentiable optimization problems involving locally Lipschitz -invex functions. Antczak [16] also considered a class of nonsmooth minimax programming problems in which functions involved are locally Lipschitz -invex. We point out that this locally Lipschitz -invexity includes the -convexity as a special case and Yuan et al. [7] defined firstly the -convexity with a convex functional .

Due to a growing number of theoretical and practical applications, semi-infinite programming has recently become one of the most substantial research areas in applied mathematics and operations research. For more details on semi-infinite programming we refer to the survey papers [17–19] and for clear understanding of different aspects of semi-infinite programming we refer to [20]. M. V. Ştefănescu and A. Ştefănescu [17] considered differentiable Problem with new -invexity. However, the results of this kind of programming can not be used to deal with the concrete nonsmooth semi-infinite minimax programming problem as presenting in Example 9 in Section 3 since the objective function is nondifferentiable at . Therefore, we are interested in dealing with nonsmooth Problem with locally Lipschitz -invexity proposed in [13], in this paper.

The rest of the paper is organized as follows. In Section 2, we present concepts regarding Lipschtiz -invexity. In Section 3, we present not only necessary but also sufficient optimality conditions for nonsmooth Problem . When the necessary optimality conditions and the -invexity concept are utilized, dual Problem is formulated for the primal and duality results between them are presented in Section 4. Section 5 is our conclusions.

2. Notations and Preliminaries

In this section, we provide some definitions and results that we shall use in the sequel. Let be a subset of and denote , , , and .

Definition 1. A real-valued function is said to be locally Lipschitz on if, for any , there exist a neighborhood of and a positive constant such that

Definition 2 (see [21]). Let and . If

exists, then is said to be the Clarke derivative of at in the direction . If this limit superior exists for all , then is called Clarke differentiable at . The set

is called the Clarke subgradient of at .

Note that if a function is locally Lipschitz, then its Clarke subgradient must exist.

The definition of the locally Lipschitz -invexity was introduced by Antczak and Stasiak [13]; see also the following Definition 3. This generalized invexity was introduced as a generalization of differentiable -invexity notion defined by Caristi et al. and M. V. Ştefănescu and A. Ştefănescu in [14, 17]. The main tool used in the definition of the locally Lipschitz -invexity notion is the above Clarke generalized subgradient (see Definition 2).

Definition 3. Let be a real-valued Lipschitz function on . For fixed , let be convex with respect to the third argument on such that for every and any . If there exists a real-valued function such that

holds for all (), then is said to be (strictly) locally Lipschitz -invex at on or shortly (strictly) -invex at on . If is (strictly) locally Lipschitz -invex at any of , then is (strictly) locally Lipschitz -invex on .

Remark 4. In order to define an analogous class of (strictly) locally Lipschitz -incave functions, the direction of the inequality in the definition of these functions should be changed to the opposite one.

In this paper, we deal with the nonsmooth semi-infinite minimax programming Problem with the locally Lipschitz -invexity proposed by Antczak and Stasiak [13]. Here, Problem is

where and are compact subsets of some Hausdorff topological spaces, , . Let be the set of feasible solutions of Problem ; in other words, . For convenience, let us define the following sets for every :

If , then represents the index set of the active restrictions at . Note that when is not empty.

Consider the nonlinear programming problem

where . A particular case of Problem is the minimax problem in which the functions , are given by

respectively. Let . Consider the following unconstrained optimization problem :

where . Then, the relationship between Problems and is given in the following lemma.

Lemma 5. If is a local minimizer for Problem , then is also a local minimizer for Problem .

To deal with the nonsmooth Problem , we need the following Conditions 1 and 2.

Condition 1. We assume that (a) the sets and are compact; (b) the function is upper semicontinuous in , and the function is upper semicontinuous in ; (c) the function is locally Lipschitz in and uniformly for in , and the function is locally Lipschitz in and uniformly for in ; (d) the function is regular in ; that is, , where the symbol denotes the derivative with respect to ; also the function is regular in ; (e) the set-valued map is upper semicontinuous in , and the set-valued map is upper semicontinuous in .

Condition 2. For any finite subset , for some , the equality with , , , implies that

Clarke [22, Theorem 2.1] has shown that, under the assumptions (a)–(e) of Condition 1, the maximum function defined by (6) is locally Lipschitz; exists and is given by the formula

where denotes the inner product of vectors and . Moreover, the in (6) can be replaced by and the subgradient is given by

Similarly, the maximum function defined by (7) is locally Lipschitz; and are given by

respectively.

3. Optimality Conditions

In this section, we establish not only the necessary optimality conditions theorems but also the sufficient optimality conditions theorems for Problem with the functions involved being locally Lipschitz with respect to the variable .

Theorem 6 (necessary optimality conditions). Let be an optimal solution of . One also assume that Condition 1 holds. Then there exist nonnegative integers and with , vectors (), (), and scalars (), () such that

Here, one allow the case, where if , then the set is empty; similarly, if , then the set is empty.

Proof. Let be a local minimizer for Problem . This means that is a local minimizer for Problem , where and are given by (6) and (7), respectively. Therefore, is a local minimizer for Problem .

By Condition 1 and [22, Theorem 2.1], is locally Lipschitzian and regular at , so the function

has the same properties. Then, using [21, Propositions and ], we obtain

here the equality

is used in the fourth equality. Hence, by Caratheodory's theorem, there exist the nonnegative integers and and the scalars () and () such that

for some and . Note that, for each , means that there exists such that , and denote this by . Similarly, there exists such that for each . Now the desired inequalities (12) and (13) can be deduced from the above discussion.

Theorem 7 (necessary optimality conditions). Let be an optimal solution of . One also assume that Conditions 1 and 2 hold. Then there exist the nonnegative integers and with , the vectors (), (), and the scalars (), () satisfying (12) and

Proof. By Theorem 6, we need to prove , on the contrary, that is, , then one obtains from (12) and (13) that

respectively. By (19), there exist for satisfying

Now one obtains from the assumptions of Condition 2 that for ; this contradicts to (20), and we obtain the desired results.

Next, we derive a sufficient optimality conditions theorem for Problem under the assumption of -invexity as defined in Definition 3.

Theorem 8 (sufficient optimality conditions). Let satisfy conditions (12) and (18), where and . Assume that , , are -invex at on and , , are -invex at on . If and

then is an optimal solution to .

Proof. Suppose, contrary to the result, that is not an optimal solution for Problem . Hence, there exists such that

Thus,

Now, we can write the following statement:

By the generalized invexity assumptions of and , we have

Employing (26) to (25), we have

By (18) and the convexity of , we deduce that

This, together with (40) and the assumption for any , follows that

This is a contradiction to condition (12).

Example 9. Let and . Define

Then, is -invex at for each , is -invex at for each , and

Note that

Consider . Since , then we can assume . Therefore,

where . Now, from Theorem 8, we can say that is an optimal solution to .

4. Duality

Making use of the optimality conditions of the preceding section, we present dual Problem to the primal one and establish weak, strong, and strict converse duality theorems. For convenience, we use the following notations:

Our dual problem can be stated as follows:

where denotes the set of all satisfying

Note that if is empty for some , then define .

Theorem 10 (weak duality). Let and be -feasible and -feasible, respectively. Suppose that , , are -invex at on and , , are -invex at on . If

then

Proof. Suppose to the contrary that . Therefore, we obtain

Thus, we obtain

Note that

We obtain that

Therefore,

Similar to the proof of Theorem 8, by (46) and the generalized invexity assumptions of and , we have

This follows that

Thus, we have a contradiction to (35). So .

Theorem 11 (strong duality). Let Problem satisfy Conditions 1 and 2; let be an optimal solution of Problem . If the hypothesis of Theorem 10 holds for all -feasible points , then there exists , such that is a -optimal solution, and the two problems and have the same optimal values.

Proof. By Theorem 7, there exists (), satisfying the requirements specified in the theorem, such that is a -feasible solution; then the optimality of this feasible solution for follows from Theorem 10.

Theorem 12 (strict converse duality). Let and be optimal solutions of and , respectively. Suppose that are strictly -invex at for each and are -invex at for each . If

then ; that is, is a -optimal solution, and

Proof. Suppose to the contrary that . By the generalized invexity assumptions of and , we have

Therefore, we obtain from (51) and the convexity of that

holds for all and . This, together with (35), (49), and

follows that

while

Thus

From the above inequality, we can conclude that there exists , such that

or

It follows that

On the other hand, we know from Theorem 10 that

This contradicts to (59).

5. Conclusions

In this paper, we have discussed a nonsmooth semi-infinite minimax programming Problem . We have extended the necessary optimality conditions for Problem considered in [17] to the nonsmooth case; we have also extended the sufficient optimality conditions and dual results of Problem addressed by M. V. Ştefănescu and A. Ştefănescu in [17] to the nonsmooth case under the Lipschitz -invexity assumptions as defined in [16]. More exactly, we have established the necessary optimality conditions theorems for the Problem when using Caratheodory's theorem. Under the Lipschitz -invexity assumptions as defined in [13], we have derived the sufficiency of the necessary optimality conditions for Problem . In the end, we have constructed a dual model and derived duality results between Problems and . These results extend several known results to a wider class of problems.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This research is supported by the Natural Science Foundation of Guangdong Province (Grant no. S2013010013101) and the Foundation of Hanshan Normal University (Grant nos. QD20131101 and LQ200905).

References

T. Antczak, “Generalized fractional minimax programming with --invexity,” Computers & Mathematics with Applications, vol. 56, no. 6, pp. 1505–1525, 2008.

M. A. Hanson, “On sufficiency of the Kuhn-Tucker conditions,” Journal of Mathematical Analysis and Applications, vol. 80, no. 2, pp. 545–550, 1981.

A. Ben-Israel and B. Mond, “What is invexity?” The Journal of the Australian Mathematical Society B, vol. 28, no. 1, pp. 1–9, 1986.

T. Antczak, “-invex sets and functions,” Journal of Mathematical Analysis and Applications, vol. 80, pp. 545–550, 2001.

V. Preda, “On Sufficiency and duality for multiobjective programs,” Journal of Mathematical Analysis and Applications, vol. 166, no. 2, pp. 365–377, 1992.

Z. A. Liang, H. X. Huang, and P. M. Pardalos, “Optimality conditions and duality for a class of nonlinear fractional programming problems,” Journal of Optimization Theory and Applications, vol. 110, no. 3, pp. 611–619, 2001.

D. H. Yuan, X. L. Liu, A. Chinchuluun, and P. M. Pardalos, “Nondifferentiable minimax fractional programming problems with -convexity,” Journal of Optimization Theory and Applications, vol. 129, no. 1, pp. 185–199, 2006.

T. Antczak, “The notion of -invexity in differentiable multiobjective programming,” Journal of Applied Analysis, vol. 11, no. 1, pp. 63–79, 2005.

H. C. Lai and J. C. Lee, “On duality theorems for a nondifferentiable minimax fractional programming,” Journal of Computational and Applied Mathematics, vol. 146, no. 1, pp. 115–126, 2002.

T. Antczak, “Minimax programming under -invexity,” European Journal of Operational Research, vol. 158, no. 1, pp. 1–19, 2004.

I. Ahmad, S. K. Gupta, N. Kailey, and R. P. Agarwal, “Duality in nondifferentiable minimax fractional programming with --invexity,” Journal of Inequalities and Applications, vol. 2011, article 75, 2011.

S. K. Mishra and K. Shukla, “Nonsmooth minimax programming problems with --invex functions,” Optimization, vol. 59, no. 1, pp. 95–103, 2010.

T. Antczak and A. Stasiak, “-invexity in nonsmooth optimization,” Numerical Functional Analysis and Optimization, vol. 32, no. 1, pp. 1–25, 2011.

G. Caristi, M. Ferrara, and A. Ştefănescu, “Mathematical programming with -invexity,” in Generalized Convexity and Related Topics, V. Konnov Igor, T. L. Dinh, and M. Rubinov Alexander, Eds., vol. 583 of Lecture Notes in Economics and Mathematical Systems, pp. 167–176, Springer, Berlin, Germany, 2007.

M. V. Ştefănescu and A. Ştefănescu, “Minimax programming under new invexity assumptions,” Revue Roumaine de Mathématiques Pures et Appliquées, vol. 52, no. 3, pp. 367–376, 2007.

T. Antczak, “Nonsmooth minimax programming under locally Lipschitz -invexity,” Applied Mathematics and Computation, vol. 217, no. 23, pp. 9606–9624, 2011.

M. V. Ştefănescu and A. Ştefănescu, “On semi-infinite minmax programming with generalized invexity,” Optimization, vol. 61, no. 11, pp. 1307–1319, 2012.

M. López and G. Still, “Semi-infinite programming,” European Journal of Operational Research, vol. 180, no. 2, pp. 491–518, 2007.

A. Shapiro, “Semi-infinite programming, duality, discretization and optimality conditions,” Optimization, vol. 58, no. 2, pp. 133–161, 2009.

C. A. Floudas and P. M. Pardalos, Encyclopedia of Optimization, Springer, New York, NY, USA, 2nd edition, 2009.

F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, NY, USA, 1983.

F. H. Clarke, “Generalized gradients and applications,” Transactions of the American Mathematical Society, vol. 205, pp. 247–262, 1975.