Nondifferentiable mathematical programming involving ( G , β ) -invexity

In this paper, we define new vector generalized convexity, namely nondifferentiable vector -invexity, for a given locally Lipschitz vector function f. Basing on this new nondifferentiable vector generalized invexity, we have managed to deal with nondifferentiable nonlinear programming problems under some assumptions. Firstly, we present G-Karush-Kuhn-Tucker necessary optimality conditions for nonsmooth mathematical programming problems. With the new vector generalized invexity assumption, we also obtain G-Karush-Kuhn-Tucker sufficient optimality conditions for the same programming problems. Moreover, we establish duality results for this kind of multiobjective programming problems. In the end, a suitable example illustrates that the new optimality results are more useful for some class of optimization problems than the optimality conditions with invex functions.

MSC: 90C26.

Convexity plays a central role in many aspects of mathematical programming including the analysis of stability, sufficient optimality conditions and duality. Based on convexity assumptions, nonlinear programming problems can be solved efficiently. In order to treat many practical problems, there have been many attempts to weaken the convexity assumptions and many concepts of generalized convex functions have been introduced and applied to mathematical programming problems in the literature [1-4]. One of these concepts, invexity, was introduced by Hanson in [1]. He has shown that invexity has a common property in mathematical programming with convexity and that Karush-Kuhn-Tucker conditions are sufficient for global optimality of nonlinear programming under the invexity assumptions. Ben-Israel and Mond [2] also introduced the concept of preinvex functions, which is a special case of invexity. Many researchers, such as Mordukhovich [5], Mishra [6,7], Ahmad [8,9], Soleimani-Damaneh [10] and so on, are devoted to this hot topic. Furthermore, Ansari and Yao [11] edited a book which provides a good review for different variants of invexity. With generalized convexity, sufficient and dual results can be obtained, and we refer to [12-14] and references therein for more research results.

In [3], Antczak introduced new definitions of a p-invex set and a -preinvex function which is the generalization of the concept in [2]. He also discussed the differentiable and nondifferentiable nonlinear programming problems involving the -invexity-type functions in [15]. With respect to fixed functions η and b, Antczak extended the -invexity to the -invexity and generalized -invexity in [16]. Ahmad et al.[8] derived the sufficient conditions for an optimal solution to the minimax fractional problem and then established weak, strong, and strict converse duality theorems for the problem and its dual problem under -invexity assumptions. Antczak [4] considered a special kind of -invexity, -invexity, which is called r-invexity in the cases of differentiability and nondifferentiability. Later, Antczak [17] generalized the concept of (scalar) differentiable r-invex functions to the vectorial case and defined a class of V-r-invex functions. In [18], Antczak further generalized the notion of V-r-invexity to the case of nondifferentiability. Note that some other researchers were interested in studying the mathematical programming involving V-r-invex functions; see [6,7,9] and the references therein.

To further enlarge the class of mathematical models for which the theoretical tools hold, Antczak extended the invexity to G-invexity [19] for scalar differentiable functions. In the natural way, he extended the definition of G-invexity to the case of differentiable vector-valued functions. He [20] also applied this vector G-invexity to develop optimality conditions for differentiable multiobjective programming problems with both inequality and equality constraints and established the so-called G-Karush-Kuhn-Tucker necessary optimality conditions for this kind of programming under the Kuhn-Tucker constraint qualification. With vector G-invexity, he proved new duality results for nonlinear differentiable multiobjective programming problems, and a number of new vector duality problems such as G-Mond-Weir, G-Wolfe and G-mixed dual vector problems to the primal one were defined in [21]. Further, Kim et al.[22] considered a special kind of nondifferentiable multiobjective programming with G-invexity.

Motivated by [20,21,23], we enlarge the class of mathematical models for which the theoretical tools hold in this paper. Here, we present a new generalized convexity, namely nondifferentiable vector -invexity, for a given locally Lipschitz vector function f. We point out that it is very necessary to consider the nondifferentiable vector -invexity, and our reasons are as follows:

– In some case, choosing G suitably can simplify the computation of the Clarke derivative of f; see Examples 1 and 2;

– The concept of -invexity can not only unify but also extend the concepts of α-invexity and G-invexity; see Example 3. Moreover, -invexity, together with Lemma 1, can make the choosing of a vector-valued function η easy; see Example 3.

Basing on the new nondifferentiable vector generalized invexity, we have managed to deal with nonlinear programming problems under some assumptions. The rest of the paper is organized as follows. In Section 2, we present the concept of the nondifferentiable vector -invexity pertaining to a given locally Lipschitz vector function f. For a given function f, we discuss the relation between -invexity and -preinvexity in Section 3. In Section 4, we present the G-Karush-Kuhn-Tucker necessary optimality conditions for the nondifferentiable mathematical programming problems. Moreover, with this nondifferentiable vector generalized invexity assumption, we prove the G-Karush-Kuhn-Tucker sufficient optimality conditions for the nondifferentiable mathematical programming problems. In Section 5, we establish the duality results for this kind of nonsmooth multiobjective programming problems as applications of this new generalized invexity. In Section 6, we give our conclusion. Moreover, we present a suitable example which illustrates that the optimality results in this paper are more useful for some class of optimization problems than the optimality conditions with existing invexity; see Example 6.

In this section, we provide some notations and results about the nondifferentiable vector -invex functions. The following convention will be used throughout the paper. For any , :

For any function f defined on a nonempty set , denotes the range of f or the image of X under f. Moreover, let and .

Definition 1 Let , X be a nonempty set of and . If

exists, then is called the Clarke derivative of f at x in the direction d. If this limit superior exists for all , then f is called Clarke differentiable at x. The set

is called the Clarke subdifferential of f at x.

We give a direct proof for the following useful lemma, which can also be deduced from Theorem 2.3.9 in [24].

Lemma 1 (Chain rule)

Letϕbe a real-valued Lipschitz continuous function defined onX, and denote the image ofXunderϕby; letbe a differentiable function such thatis continuous onandfor each. Then the chain rule

holds for each. Therefore,

Proof On the one hand, from Definition 1 and the assumption that for all , we obtain

On the other hand, by the definition of , there exists a vector sequence , a real sequence such that (), () and

Note that

and

Therefore, by (1) and definition of , we obtain

Thus, we obtain the desired result. □

With the above chain rule, we can compute the Clarke derivative of a real-valued function f more easily than by using the definition of the Clarke derivative itself; see the following Examples 1 and 2.

Example 1 Denote

Then , and it is easy to check that

Thus, by the chain rule in Lemma 1,

Example 2 Let X be a nonempty subset of , f be a locally Lipschitz function on X, and r be an arbitrary real number. Denote

for all . By the chain rule in Lemma 1,

For differentiable functions, Antczak introduced the G-invexity in [20]. Note from Example 2 that the function may be not differentiable even if the function φ is differentiable. Thus, it is necessary to introduce the following vector -invexity concept for a given nondifferentiable function f.

Definition 2 Let be a vector-valued locally Lipschitz function defined on a nonempty set . Consider the functions , , and for . Moreover, is strictly increasing on its domain for each . If

holds for all () and , then f is said to be (strictly) nondifferentiable vector -invex at u on X (with respect to η) (or shortly, -invex at u on X), where and . If f is (strictly) nondifferentiable vector -invex at u on X (with respect to η) for all , then f is (strictly) nondifferentiable vector -invex on X with respect to η.

Remark 1 In order to define (strictly) nondifferentiable vector -incave functions with respect to η for given f, the direction of the inequality (2) in Definition 2 should be changed to the opposite one.

Remark 2 (1) Let be differentiable -invex, then is α-invex by Definition 2 in this paper and α-invexity as defined in [23], where .

(2) Let be differentiable -invex and for , then f is α-invex as defined in [23], where .

(3) Let be differentiable vector -invex and for all (), then f is vector G-invex as defined in [20]. Further, if , then f is G-invex as defined in [19].

Hence, the concept of -invexity defined in this paper not only unifies but also extends the concepts of α-invexity and G-invexity. Example 3 illustrates that there exists a function which is neither α-invex as defined in [23] nor G-invex as defined in [20], but -invex as defined in this paper. Moreover, Definition 2 together with Lemma 1 can help us to choose a vector-valued function η simply; see Example 3 too.

Example 3 Let . Define as follows:

From Lemma 1,

Define

Then, by Definition 2, f is nondifferentiable vector -invex with respect to η. Note that f is nondifferentiable. Then f is neither α-invex as defined in [23] nor G-invex as defined in [20].

In this section, we present the concept of -preinvexity and discuss its relations with -invexity introduced in the above section.

Definition 3 Let , , and . The set X is said to be α-invex at with respect to η if for all ,

X is said to be an α-invex set with respect to η if X is α-invex at each . If for all , then the α-invex set X with respect to η is called an invex set X with respect to η.

Definition 4 Let X be an invex set (with respect to η) in as defined in Definition 3. Consider the functions and (). If

hold for all (), then is said to be (strictly) vector b-preinvex at u on X with respect to η, where . If f is (strictly) vector b-preinvex at u on X with respect to η for each , then f is (strictly) vector b-preinvex on X with respect to η.

Definition 5 Let X be an invex set (with respect to η) of as defined in Definition 3. Consider the functions , , and (). Moreover, is strictly increasing on for . If

hold for all (), then is said to be (strictly) vector -preinvex at u on X with respect to η, where and . If f is (strictly) vector -preinvex at u on X for all , then f is (strictly) vector -preinvex on X with respect to η.

Example 4 Let . Define

Then it is easy to check that f is -invex on ℝ with respect to the function η defined by , where for all . However, f is not b-invex at with respect to the same η and b, since

Above Example 4 illustrates there exists a function which is not b-preinvex but -preinvex. Next, we give another useful lemma and the proof is omitted.

Lemma 2Letφbe an increasing function defined on, thenexists andis increasing on.

Theorem 1LetXbe an invex set (with respect toη) inandbe a function defined onX; letbe a function such thatis strictly increasing onfor; let, where (). Thenfis (strictly) vector-preinvex atuonXwith respect toηif and only ifis (strictly) vectorb-preinvex atuonXwith respect to the sameη.

Proof ‘if’ part. Let be (strictly) vector b-preinvex at u on X with respect to η. We get from Definition 4

Thus, we obtain with Lemma 2

By Definition 5, we deduce f is (strictly) vector -preinvex at u on X with respect to the same η.

Moreover, the above steps are invertible, so the result follows. □

Theorem 2LetXbe an invex set (with respect toη) in; letbe (strictly) vector-preinvex onXwith respect toη; assume thatis differentiable and strictly increasing on, is continuous onfor each. Moreover, for any. Thenfis vector-invex onXwith respect toη, wherefor.

Proof Since is (strictly) vector -preinvex on X with respect to η, then from Theorem 1 is (strictly) vector b-preinvex on X with respect to η. That is, for any (),

Hence,

Therefore, by the definition of the superior limit and continuity, one obtains

which together with Lemma 1 gives

Thus, the result follows. □

Example 5 Let X be an invex set (with respect to η) of and be (strictly) -preinvex on X with respect to η. For any given real number r, let φ be the function defined in Example 2 and denote by . Then from Theorem 2 f is nondifferentiable vector -invex on X with respect to η, where for . That is, the inequalities

hold for any and for each . Thus, f is exactly the locally Lipschitz V-r-invexity with respect to η on X or r-invex.

Remark 3 By Definition 2 and Example 5, we know that both a V-r-invex function and an r-invex function are nondifferentiable vector -invex.

In general, a multiobjective programming problem is formulated as the following vector minimization problem:

where X is a nonempty set of , () and () are real-valued Lipschitz functions on X.

Let be the set of all feasible solutions for the problem (CVP). Further, denote by the set of constraint indices active at .

The above multiobjective programming problem (CVP) was widely used in applied sciences. Recently, this kind of programming was used to solve problems arising in fields such as bioinformatics, computational biology, molecular biology, wastewater treatment, drug discovery, and food processing.

For convenience, we need the following vector minimization problem:

where . Denote by , . Then it is easy to see that and . So, the set of all feasible solutions and the set of constraint active indices for either (CVP) or (G-CVP) are denoted by E and , respectively.

Before studying optimality in multiobjective programming, we have to define clearly the concepts of optimality and solutions in relation to a multiobjective programming problem. Note that in vector optimization problems, there is a multitude of competing definitions and approaches. One of the dominating ones is (weak) Pareto optimality. The (weak) Pareto optimality in multiobjective programming associates the concept of a solution with some property that seems intuitively natural.

Definition 6 A feasible point is said to be a (weakly) efficient solution for a multiobjective programming problem (CVP) if and only if there exists no such that

Lemma 3Letbe strictly increasing onfor eachandbe strictly increasing onfor each. Further, let, . Thenis a (weakly) efficient solution for (CVP) if and only ifis a (weakly) efficient solution for (G-CVP).

The first necessary conditions for the inequality-constrained problem have been presented in 1948 by Fritz John; while stronger necessary conditions for the same inequality-constrained problem were obtained in 1951 by Kuhn and Tucker. Since then, optimality conditions of Fritz John and Karush-Kuhn-Tucker type for differentiable or nondifferentiable nonconvex multiobjective programming problems were established under different assumptions. For example, optimality conditions of Fritz-John and Karush-Kuhn-Tucker type for nondifferentiable convex multiobjective programming problems were established by Kanniappan. Later, Craven proved these conditions for nondifferentiable multiobjective programming problems involving locally Lipschitz functions. Also, under some constraint qualifications, Lee proved the Karush-Kuhn-Tucker necessary optimality conditions for multiobjective programming problems involving Lipschitz functions. Moveover, Soleimani-Damaneh characterized the weak Pareto-optimal solutions of nonsmooth multiobjective programs in Asplund spaces under locally Lipschitz and generalized convexity conditions. Further, he established some sufficient conditions for optimality and proper optimality for multiple-objective programs in Banach spaces after extending the concept of vector invexity.

Recently, Antczak [19] introduced the so-called G-Karush-Kuhn-Tucker necessary optimality conditions for a differentiable mathematical programming problem. In a natural way, he [20] extended the so-called G-Karush-Kuhn-Tucker necessary optimality conditions to the vectorial case for differentiable multiobjective programming problems. From the discussion in the above sections, it is interesting to consider the nondifferentiable nonlinear programming. Hence, we present not only G-Karush-Kuhn-Tucker necessary optimality but also G-Karush-Kuhn-Tucker sufficient optimality for this kind of nondifferentiable mathematical programming problems.

Theorem 3 (G-Fritz John necessary optimality condition)

Letbe a function defined onsuch thatis nonnegative and continuous onfor each; letbe a function defined onsuch thatis nonnegative and continuous onfor each. Ifis a (weakly) efficient solution for (CVP), then there exist, andsuch that

Proof Since is a (weakly) efficient solution for (CVP), then by Lemma 3, is a (weakly) efficient solution for (G-CVP). Therefore, from Theorem 10 of [18], we have

Hence, by Lemma 1, we get the desired result. □

The G-Karush-Kuhn-Tucker necessary optimality conditions for to be (weak) Pareto optimal are obtained from the above Fritz John necessary optimality conditions under some constraint qualifications.

Now, we give a generalized Slater type constraint qualification. Under this regularity constraint qualification, we establish the G-Karush-Kuhn-Tucker necessary optimality conditions for the considered nonsmooth multiobjective programming problem (CVP).

Definition 7 The program (CVP) is said to satisfy the generalized Slater type constraint at if there exists such that and is -invex with respect to η at on E, where .

Theorem 4 (G-Karush-Kuhn-Tucker necessary optimality condition)

Letbe a function defined onsuch thatis nonnegative and continuous onfor each; letbe a function defined onsuch thatis nonnegative and continuous onfor each. Assume thatis a (weakly) efficient solution for (CVP) and the program (CVP) satisfies the generalized Slater type constraint at. Then there exist, andsuch that

Proof On the one hand, since is a (weakly) efficient solution for (CVP), the necessary optimality conditions of G-Fritz John type (5)-(7) for (CVP) are fulfilled. Let us suppose that . Then by (6) we have that for all , and there exists at least one such that . Thus, from (5), Lemma 1, and subdifferential calculus (see [24]), it follows that

This implies that there exists , , such that

Note that is assumed to be -invex with respect to η at . Then

On the other hand, it follows from the generalized Slater type constraint qualification that there exists such that for all . Since at least for one , we obtain the following inequality:

which contradicts (11). □

Now, under the assumption of generalized invexity defined in Section 2, we can establish sufficient optimality conditions for nonsmooth multiobjective programming problems involving locally Lipschitz functions.

Theorem 5 (G-Karush-Kuhn-Tucker sufficient optimality conditions)

Letbe a feasible point for (CVP); letbe differentiable and strictly increasing onfor each, and letbe differentiable and strictly increasing onfor each. Moreover, G-Karush-Kuhn-Tucker necessary optimality conditions (8)-(10) are satisfied at. Iffis nondifferentiable vector-invex atonXwith respect toηandgis nondifferentiable vector-invex atonXwith respect to the sameη, thenis a (weakly) efficient solution for (CVP).

Proof Suppose, contrary to the result, that is not a weakly efficient solution for (CVP). By Lemma 3, is not a weakly efficient solution for (G-CVP). Hence, there exists such that

By the generalized invexity assumption of f and g, we have

where () and (). Multiplying (14) by , we get

From (8), (9), (13), and (15), we have

Note that . Then

which contradicts the G-Karush-Kuhn-Tucker necessary optimality condition (8). Hence, is a weakly efficient solution for (CVP), and the proof is complete. □

Theorem 6 (G-Karush-Kuhn-Tucker sufficient optimality conditions)

Letbe a feasible point for (CVP); letbe differentiable and strictly increasing onfor each, and letbe differentiable and strictly increasing onfor each. Moreover, G-Karush-Kuhn-Tucker necessary optimality conditions (8)-(10) are satisfied at. Iffis strictly nondifferentiable vector-invex atonXwith respect toηandgis nondifferentiable vector-invex atonXwith respect to the sameη, thenis an efficient solution for (CVP).

Proof Proof is similar to the proof of Theorem 5. □

Duality is an important concept in the study of optimization problems. Several duals, including the Mond-Weir dual and the Wolfe dual, have been introduced for various nonlinear programming problems. For example, Ahmad et al.[9] considered the Mond-Weir type dual program of nonsmooth multiobjective programming involving generalized V-r-invex functions. Further, Soleimani-Damaneh considered Mond-Weir type and Wolfe type duals for a general nonsmooth optimization problem in Banach algebras. As applications of our new generalized invexity, we also establish dual results following the approaches of Mond and Weir. We formulate the following dual problem for (CVP):

Let W denote the set of all feasible solutions for the dual problem (MWD). Further, denote by Y the set .

Theorem 7 (Weak duality)

Letxandbe feasible solutions for (CVP) and (MWD), respectively. Moreover, assume thatandare-invex and-invex atyonwith respect to the sameη, respectively, whereand. Then.

Proof Let x and be feasible solutions for (CVP) and (MWD), respectively. Then there exist , and , , such that

We proceed by contradiction. Suppose that

Since and are -invex and -invex at y on with respect to the same η, respectively. Then, by Definition 2, the system

holds for all . Hence, we deduce that the inequality

holds for all , , , . This contradicts (16). □

Theorem 8 (Strong duality)

Letbe a (weakly) efficient solution in (CVP). Then there exist, , , such thatis feasible in (MWD). If, also weak duality theorem holds for problems (CVP) and (MWD), thenis a (weakly) efficient solution in (MWD) and the optimal values in both problems are the same.

Proof Let be a (weakly) efficient solution in (CVP). Then there exist , , , such that the G-Karush-Kuhn-Tucker optimality conditions (5)-(7) are fulfilled at . Thus, by the G-Karush-Kuhn-Tucker optimality conditions (5)-(7), we conclude that is feasible in (MWD). Suppose that is not a (weakly) efficient solution in (MWD). Then there exists such that

But the above inequality is a contradiction to weak duality. Thus, is a (weakly) efficient solution in (MWD), and the optimal values in both problems are the same. □

Theorem 9 (Converse duality)

Letbe a (weakly) efficient solution for (MWD) such that. Moreover, assume thatandare (strictly) -invex and (strictly) -invex atonwith respect to the sameη, respectively, whereand. Thenis a (weakly) efficient solution in (CVP).

Proof Since is a (weakly) efficient point in (MWD), then it is feasible in (MWD). Hence, , , and the second constraint of (MWD) is fulfilled at . Thus, we have

We proceed by contradiction. Suppose that is not a (weakly) efficient point in (MWD). Then there exists such that

Since and are (strictly) -invex and (strictly) -invex at on with respect to the same η, respectively, then, by Definition 2, the inequalities

hold for all . Hence, it is also true for . Thus, we deduce that the inequality

holds for all , , , , which contradicts the feasibility of in (MWD). □

This paper presents a new type of generalized invexity, namely nondifferentiable -invexity for a given locally Lipschitz function f defined on . This new invexity not only unifies but also extends the existing G-invexity and α-invexity presented in literatures. We have constructed auxiliary mathematical programming (G-CVP) and have discussed the relations between programming (G-CVP) and (CVP). With (G-CVP), we have proved the G-Karush-Kuhn-Tucker necessary optimality conditions for (CVP). Our statement of the so-called G-Kuhn-Tucker necessary optimality conditions established in this paper is more general than the classical Kuhn-Tucker necessary optimality conditions found in the literature. Also, we have proved the sufficiency of the introduced G-Karush-Kuhn-Tucker necessary optimality conditions for (CVP) under the new nondifferentiable vector invexity assumption. More exactly, this result has been proved for such multiobjective programming problems in which the objective functions, the constraints are nondifferentiable vector generalized invex with respect to the same η defined in Section 2, but not necessarily with respect to the same G; see the following example. As applications of our new generalized invexity, we establish dual results for (CVP) under the Mond-Weir dual programming. Note that many researchers were interested in studying minimax programming or fractional programming with different generalized invexities; see [6,8,10,15]. As pointed out by an anonymous referee, we will study minimax programming or fractional programming under the invexity proposed in this sequel in the future.

To illustrate the approach to optimality considered in the paper, we here give an example of a nonsmooth multiobjective programming problem involving nondifferentiable vector generalized invex functions with respect to the same function η defined in Section 2.

Example 6 Let . We consider the following (CVP):

where

It is not difficult to see that , , g are locally Lipschitz functions and, moreover, the set of all feasible solutions . Note also that a feasible solution is an efficiently optimal in the considered nonsmooth vector optimization problem. Then, from Example 3, f and g are nondifferentiable vector -invex and -invex with respect to the same η, respectively, where η, , and are defined in Example 3. Also, it can be established that the G-Karush-Kuhn-Tucker necessary optimality conditions (8)-(10) are satisfied at . Since all the hypotheses of Theorem 6 are fulfilled, then is an efficient optimal in the considered multiobjective programming problem. Further, note that the sufficient optimality Theorem 20 in [19] for efficient optimality is not applicable to the considered multiobjective programming problem (CVP). This follows from the fact that all functions involved in the considered multiobjective programming problem are nondifferentiable.

The authors declare that they have no competing interests.

All authors carried out the proof. All authors conceived of the study, and participated in its design and coordination. All authors read and approved the final manuscript.

The authors are grateful to the referees for their valuable suggestions that helped to improve the paper in its present form. This research is supported by the Science Foundation of Hanshan Normal University (LT200801).

1. Hanson, MA: On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl.. 80, 545–550 (1981). Publisher Full Text

2. Ben-Israel, A, Mond, B: What is invexity. J. Aust. Math. Soc. Ser. B. 28, 1–9 (1986). Publisher Full Text

3. Antczak, T: -invex sets and functions. J. Math. Anal. Appl.. 263, 355–379 (2001). Publisher Full Text

4. Antczak, T: r-preinvexity and r-invexity in mathematical programming. Comput. Math. Appl.. 50(3-4), 551–566 (2005). Publisher Full Text

5. Mordukhovich, BS: Multiobjective optimization problems with equilibrium constraints. Math. Program.. 117(1), 331–354 (2009). Publisher Full Text

6. Mishra, SK, Shukla, K: Nonsmooth minimax programming problems with V-r-invex functions. Optimization. 59(1), 95–103 (2010). Publisher Full Text

7. Mishra, SK, Singh, V, Wang, SY, Lai, KK: Optimality and duality for nonsmooth multiobjective optimization problems with generalized V-r-invexity. J. Appl. Anal.. 16, 49–58 (2010)

8. Ahmad, I, Gupta, SK, Kailey, N, Agarwal, RP: Duality in nondifferentiable minimax fractional programming with -invexity. J. Inequal. Appl.. 2011, Article ID 1 (2011)

9. Ahmad, I, Gupta, SK, Jayswal, A: On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized V-r-invex functions. Nonlinear Anal., Theory Methods Appl.. 74(17), 5920–5928 (2011). Publisher Full Text

10. Soleimani-Damaneh, M: Optimality for nonsmooth fractional multiple objective programming. Nonlinear Anal., Theory Methods Appl.. 68(10), 2873–2878 (2008). Publisher Full Text

11. Ansari, QH, Yao, J-C: Recent Developments in Vector Optimization, Springer, Berlin (2012)

12. Li, J, Gao, Y: Non-differentiable multiobjective mixed symmetric duality under generalized convexity. J. Inequal. Appl.. 2011, Article ID 23. doi:10.1186/1029-242X-2011-23 (2011)

13. Gao, Y: Higher-order symmetric duality for a class of multiobjective fractional programming problems. J. Inequal. Appl.. 2012, Article ID 142. doi:10.1186/1029-242X-2012-142 (2012)

14. Gupta, SK, Dangar, D, Kumar, S: Second-order duality for a nondifferentiable minimax fractional programming under generalized α-univexity. J. Inequal. Appl.. 2012, Article ID 187. doi:10.1186/1029-242X-2012-187 (2012)

15. Antczak, T: Minimax programming under -invexity. Eur. J. Oper. Res.. 158, 1–19 (2004). Publisher Full Text

16. Antczak, T: Generalized -invexity functions and nonlinear mathematical programming. Numer. Funct. Anal. Optim.. 30(1-2), 1–22 (2009). Publisher Full Text

17. Antczak, T: V-r-invexity in multiobjective programming. J. Appl. Anal.. 11(1), 63–80 (2005)

18. Antczak, T: Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity. J. Glob. Optim.. 45(2), 319–334 (2009). Publisher Full Text

19. Antczak, T: New optimality conditions and duality results of G-type in differentiable mathematical programming. Nonlinear Anal., Theory Methods Appl.. 66, 1617–1632 (2007). Publisher Full Text

20. Antczak, T: On G-invex multiobjective programming. Part I. Optimality. J. Glob. Optim.. 43(1), 97–109 (2009). Publisher Full Text

21. Antczak, T: On G-invex multiobjective programming. Part II. Duality. J. Glob. Optim.. 43(1), 111–140 (2009). Publisher Full Text

22. Kim, HJ, Seo, YY, Kim, DS: Optimality conditions in nondifferentiable G-invex multiobjective programming. J. Inequal. Appl.. 2010, Article ID 172059. doi:10.1155/2010/172059 (2010)

23. Noor, M: On generalized preinvex functions and monotonicities. J. Inequal. Pure Appl. Math.. 5(4), 1–9 (2004)

24. Clarke, FH: Optimization and Nonsmooth Analysis, Wiley-Interscience, New York (1983)