Abstract
In this paper, a pair of Wolfe type higher-order symmetric nondifferentiable multiobjective programs over arbitrary cones is formulated and appropriate duality relations are then established under higher-order-K--convexity assumptions. A numerical example which is higher-order K--convex but not higher-order K-F-convex has also been illustrated. Special cases are also discussed to show that this paper extends some of the known works that have appeared in the literature.
MSC: 90C29, 90C30, 49N15.
Similar content being viewed by others
1 Introduction
Mangasarian [1] introduced the concept of second- and higher-order duality for nonlinear problems. He has also indicated that the study is significant due to the computational advantage over the first-order duality as it provides tighter bounds for the value of the objective function when approximations are used. Motivated by the concept in [1], several researchers [2–19] have worked in this field.
Multiobjective optimization has a large number of applications. As an example, it is generally used in goal programming, risk programming etc. Optimality conditions for multiobjective programming problems can be found in Miettinen [20] and Pardalos et al. [21]. Recently, Chinchuluun and Pardalos [22] discussed recent developments in multiobjective optimization. These include optimality conditions, applications, global optimization techniques, the new concept of epsilon pareto optimal solutions and heuristics.
Chen [7] considered a pair of symmetric higher-order Mond-Weir type nondifferentiable multiobjective programming problems and established usual duality results under higher-order F-convexity assumptions. Gulati and Gupta [9] proved duality theorems for a pair of Wolfe type higher-order nondifferentiable symmetric dual programs. Ahmad et al. [6] formulated a general Mond-Weir type higher-order dual for a nondifferentiable multiobjective programming problem and established usual duality results.
Gulati and Geeta [23] pointed out certain omissions in some papers on symmetric duality in multiobjective programming and discussed their corrective measures. Later on, Ahmad and Husain [5] and Gulati et al. [11] formulated second-order multiobjective symmetric dual programs with cone constraints and established duality results under second-order invexity assumptions. An omission in the strong duality theorem in Yang et al. [17] has been rectified in Gupta and Kailey [12].
The concept of -convexity was introduced by Preda [24] as an extension of F-convexity [25] and ρ-convexity [26]. Yang et al. [18] formulated several second-order duals for scalar programming problem and proved duality results involving generalized F-convex functions. Zhang and Mond [19] extended the class of -convex functions to second-order and obtained duality relations for multiobjective dual problems.
Motivated by various concepts of generalized convexity, Liang et al. [27] introduced a unified formulation of generalized convexity, called -convexity and obtained corresponding optimality conditions and duality relations for a single objective fractional problem. This was later on extended to multiobjective fractional programming problem in Liang et al. [28]. Inspired by the concept given in [19, 27, 28], Ahmad and Husain [29] introduced second-order -convex functions and proved duality relations for Mond-Weir type second-order multiobjective problems. In the recent work of Ahmad and Husain [30], an attempt is made to remove certain omissions and inconsistencies in the work of Mishra and Lai [31].
Agarwal et al. [2] achieved duality results for a pair of Mond-Weir type multiobjective higher-order symmetric dual programs over arbitrary cones under higher-order K-F-convexity assumptions. Recently, Agarwal et al. [32] have filled some gap in the work of Chen [7] and proved a strong duality theorem for Mond-Weir type multiobjective higher-order nondifferentiable symmetric dual programs.
In this paper, we formulate a pair of symmetric higher-order Wolfe type nondifferentiable multiobjective programs over arbitrary cones and prove weak, strong and converse duality theorems under higher-order-K--convexity assumptions. We also give a nontrivial example of a function lying in the class of higher-order K--convex but not in the class of higher-order K-F-convex. Our study extends some of the known results that appeared in [4, 8, 16, 17].
2 Notations and preliminaries
Consider the following multiobjective programming problem:
where is open, , , K is a closed convex pointed cone in with and C is a closed convex cone in with nonempty interior.
Definition 1 [33]
The positive polar cone of C is defined as
Definition 2 [33]
A point is a weak efficient solution of (P) if there exists no other such that
Definition 3 [34]
A point is an efficient solution of (P) if there exists no other such that
Let D be a compact convex set in . The support function of D is defined by
A support function, being convex and everywhere finite, has a subdifferential, that is, there exists such that
The subdifferential of is given by
For any set , the normal cone to S at a point is defined by
It can be easily seen that for a compact convex set D, y is in if and only if , or equivalently, x is in .
A functional (where ) is sublinear with respect to the third variable if, for all ,
(i) for all , and
(ii) , for all and .
For notational convenience, we write
Let be a sublinear functional with respect to the third variable. Now, we recall the concept of higher-order K-F-convexity introduced in [2].
Definition 6 A differentiable function is said to be higher-order K-F-convex at u on S with respect to if, for all and , we have
Remark 1
(i) If , then the above definition reduces to higher-order F-convexity given in [7, 9, 32].
(ii) If and , , then Definition 6 becomes second-order F-convexity as considered in [12, 17].
(iii) Taking , and , then the definition reduces to second-order invexity (or η bonvexity) given in [5, 11, 15].
Definition 7 A differentiable function is said to be higher-order K--convex at u on S with respect to if for all and , there exist vector , a real valued function and such that
Remark 2
(i) If , and , , the definition of higher-order K--convexity reduces to second-order -convexity given by Srivastava and Bhatia [14].
(ii) If , and , then Definition 7 reduces to higher-order F-convexity (see [7, 9]).
(iii) If we take , , , and , where η is a function from to , then the above definition becomes second-order η-convexity given in [15].
Next, we illustrate a nontrivial example of higher-order K--convex functions which are not higher-order K-F-convex.
Example 1 Let , , , . Consider the function to be defined by , where
and to be identified by . Let the functional be defined by
Suppose is given by , where
and is defined by , where
To show ψ is higher-order -convex, we need to prove
which for and gives
where
and
But
and
Hence, . Therefore, ψ is higher-order K--convex with respect to ζ.
Next, we need to show that ψ is not higher-order K-F-convex with respect to ζ. To prove it, we will show that
i.e., either
or
Since
In fact, for all as can be seen from Figure 4. Therefore, ψ is not higher-order K-F-convex with respect to ζ.
3 Wolfe type higher-order symmetric duality
In this section, we consider the following Wolfe type nondifferentiable multiobjective higher-order symmetric dual programs.
Primal problem (HNWP) K-minimize
subject to
Dual problem (HNWD) K-maximize
subject to
where
(i) and are closed convex cones with nonempty interiors in and , respectively,
(ii) and are open sets such that ,
(iii) , and are differentiable functions, , ,
(iv) r and p are vectors in and , respectively,
(v) D and E are compact convex sets in and , respectively, and
(vi) and are the support functions of D and E, respectively.
Remark 3 The problems (HNWP) and (HNWD) stated above are nondifferentiable because their objective function contains the support function and .
We now prove the following duality results for the pair of problems (HNWP) and (HNWD).
Theorem 1 (Weak duality)
Let be feasible for the primal problem (HNWP) and be feasible for the dual problem (HNWD). Let the sublinear functionals and satisfy the following conditions:
Suppose that (i) either or and , (ii) is higher-order K--convex at u with respect to , and (iii) is higher-order K--convex at y with respect to . Then
Proof Since is higher-order K--convex with respect to , we have
It follows from , , and sublinearity of F that
As is higher-order K--convex with respect to , therefore we get
Again, using , , and sublinearity of G, we obtain
Further, adding the inequalities (10) and (11), we have
Now, since is feasible for the primal problem (HNWP) and is feasible for the dual problem (HNWD), , by the dual constraint (5), the vector , and so from the hypothesis (A), we obtain
Similarly,
for the vector .
Using (13), (14) and the hypothesis (i) in (12), we have
Further, substituting the values of a and b, we have
In view of the fact that , and , the last inequality yields
Now, suppose contrary to the result that (9) does not hold, that is,
or
It follows from and that
which contradicts (15). Hence the result. □
Theorem 2 (Strong duality)
Let be a twice differentiable function and let be a weak efficient solution of (HNWP). Suppose that
(i) the matrix is nonsingular,
(ii) the vectors are linearly independent,
(iii) the vector ,
(iv) implies ,
(v) , , , and
(vi) K is a closed convex pointed cone with .
Then
(I) there exists such that is feasible for (HNWD), and
(II) .
Also, if the hypotheses of Theorem 1 are satisfied for all feasible solutions of (HNWP) and (HNWD), then is an efficient solution for (HNWD).
Proof Since is a weak efficient solution of (HNWP), by the Fritz John necessary optimality conditions [33], there exist , , , such that the following conditions are satisfied at :
From (18) and nonsingularity of , we have
Also, (19) is equivalent to
If , then (25) yields . Further, the above equality gives or . Consequently, , contradicting (24). Hence, .
Since , therefore .
But or
Now, using (25) and (26) in (17), we get
which, by the hypotheses (iii) and (iv), implies
Using the hypothesis (iii) in (27), we obtain
Since the vectors are linearly independent, therefore the above equation yields
From (28) in (25), we get
Using (26) and (28)-(30) in (16), we have
From the hypothesis (v), for , the above inequality yields
Let . Then , and so (31) implies
Therefore,
Also, from (26), (30) and , we obtain . Thus , satisfies the dual constraints from (5) to (8) in (HNWD), and so it is a feasible solution for the dual problem (HNWD). Now, letting and in (31), we get
From (22) and (30), . Since , . Also, as E is a compact convex set in , .
Further, from (20), (26) and (30) and the above relation, we obtain
Therefore, using (28), (33), (34) and the hypothesis (v), for , we get
that is, the two objective values are equal.
Now, let be not an efficient solution of (HNWD), then there exists feasible for (HNWD) such that
As , and from the hypothesis (v), for , we obtain
which contradicts Theorem 1. Hence, is an efficient solution of (HNWD). □
Theorem 3 (Converse duality)
Let be a twice differentiable function and let be a weak efficient solution of (HNWD). Suppose that
(i) the matrix is nonsingular,
(ii) the vectors are linearly independent,
(iii) the vector ,
(iv) implies ,
(v) , , , and
(vi) K is a closed convex pointed cone with .
Then
(I) there exists such that is feasible for (HNWP), and
(II) .
Also, if the hypotheses of Theorem 1 are satisfied for all feasible solutions of (HNWP) and (HNWD), then is an efficient solution for (HNWP).
Proof It follows on the lines of Theorem 2. □
4 Special cases
In this section, we consider some of the special cases of the problems studied in Section 3. In all these cases, , , , and .
(i) For , , , where A and B are positive semidefinite matrices, and . In this case, (HNWP) and (HNWD) reduce to the problems considered in Ahmad and Husain [4].
(ii) Let , and , then our problems (HNWP) and (HNWD) become the problems studied in Gulati et al. [8].
(iii) If , then our problems (HNWP) and (HNWD) reduce to the programs studied in Yang et al. [16].
(iv) Let and , our problems reduce to (MP) and (MD) considered in Yang et al. [17] along with nonnegativity restrictions and . However, taking and along with the hypotheses (A) and (B) of Theorem 1 in [17] gives and .
5 Conclusions
A pair of Wolfe-type multiobjective higher-order symmetric dual programs involving nondifferentiable functions over arbitrary cones has been formulated. Further, an example of higher-order K--convex which is not higher-order K-F-convex has been illustrated. Weak, strong and converse duality theorems under higher-order K--convexity assumptions have also been established. It is to be noted that some of the known results, including those of Ahmad and Husain [4], Gulati et al. [8] and Yang et al. [16, 17], are special cases of our study. This work can be further extended to study nondifferentiable higher-order multiobjective symmetric dual programs over arbitrary cones with different ’s and different support functions.
References
Mangasarian OL: Second and higher-order duality in nonlinear programming. J. Math. Anal. Appl. 1975, 51: 607–620. 10.1016/0022-247X(75)90111-0
Agarwal RP, Ahmad I, Jayswal A: Higher-order symmetric duality in nondifferentiable multiobjective programming problems involving generalized cone convex functions. Math. Comput. Model. 2010, 52: 1644–1650. 10.1016/j.mcm.2010.06.030
Ahmad I: Second-order symmetric duality in nondifferentiable multiobjective programming. Inf. Sci. 2005, 173: 23–34. 10.1016/j.ins.2004.06.002
Ahmad I, Husain Z: On nondifferentiable second-order symmetric duality in mathematical programming. Indian J. Pure Appl. Math. 2004, 35: 665–676.
Ahmad I, Husain Z: On multiobjective second-order symmetric duality with cone constraints. Eur. J. Oper. Res. 2010, 204: 402–409. 10.1016/j.ejor.2009.08.019
Ahmad I, Husain Z, Sharma S: Higher-order duality in nondifferentiable multiobjective programming. Numer. Funct. Anal. Optim. 2007, 28: 989–1002. 10.1080/01630560701563800
Chen X: Higher-order symmetric duality in nondifferentiable multiobjective programming problems. J. Math. Anal. Appl. 2004, 290: 423–435. 10.1016/j.jmaa.2003.10.004
Gulati TR, Ahmad I, Husain I: Second-order symmetric duality with generalized convexity. Opsearch 2001, 38: 210–222.
Gulati TR, Gupta SK: Higher-order nondifferentiable symmetric duality with generalized F -convexity. J. Math. Anal. Appl. 2007, 329: 229–237. 10.1016/j.jmaa.2006.06.032
Gulati TR, Gupta SK: Higher-order symmetric duality with cone constraints. Appl. Math. Lett. 2009, 22: 776–781. 10.1016/j.aml.2008.08.017
Gulati TR, Saini H, Gupta SK: Second-order multiobjective symmetric duality with cone constraints. Eur. J. Oper. Res. 2010, 205: 247–252. 10.1016/j.ejor.2009.12.024
Gupta SK, Kailey N: A note on multiobjective second-order symmetric duality. Eur. J. Oper. Res. 2010, 201: 649–651. 10.1016/j.ejor.2009.03.024
Hanson MA: Second-order invexity and duality in mathematical programming. Opsearch 1993, 30: 313–320.
Srivastava MK, Bhatia M:Symmetric duality for multiobjective programming using second-order -convexity. Opsearch 2006, 43: 274–295.
Suneja SK, Lalitha CS, Khurana S: Second-order symmetric duality in multiobjective programming. Eur. J. Oper. Res. 2003, 144: 492–500. 10.1016/S0377-2217(02)00154-6
Yang XM, Yang XQ, Teo KL: Non-differentiable second-order symmetric duality in mathematical programming with F -convexity. Eur. J. Oper. Res. 2003, 144: 554–559. 10.1016/S0377-2217(02)00156-X
Yang XM, Yang XQ, Teo KL, Hou SH: Multiobjective second-order symmetric duality with F -convexity. Eur. J. Oper. Res. 2005, 165: 585–591. 10.1016/j.ejor.2004.01.028
Yang XM, Yang XQ, Teo KL, Hou SH: Second order duality for nonlinear programming. Indian J. Pure Appl. Math. 2004, 35: 699–708.
Zhang J, Mond B: Second order duality for multiobjective nonlinear programming involving generalized convexity. In Proceedings of the Optimization Miniconference III. Edited by: Glower BM, Craven BD, Ralph D. University of Ballarat, Ballarat; 1997:79–95.
Miettinen KM: Nonlinear Multiobjective Optimization. Kluwer, Boston; 1999.
Pardalos PM, Siskos Y, Zopounidis C: Advances in Multicriteria Analysis. Kluwer, Netherlands; 1995.
Chinchuluun A, Pardalos PM: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 2007, 154: 29–50. 10.1007/s10479-007-0186-0
Gulati TR, Geeta M: On some symmetric dual models in multiobjective programming. Appl. Math. Comput. 2009, 215: 380–383. 10.1016/j.amc.2009.05.032
Preda V: On efficiency and duality for multiobjective programs. J. Math. Anal. Appl. 1992, 166: 356–377.
Hanson MA, Mond B: Further generalization of convexity in mathematical programming. J. Inf. Optim. Sci. 1986, 3: 25–32.
Vial JP: Strong and weak convexity of sets and functions. Math. Oper. Res. 1983, 8: 231–259. 10.1287/moor.8.2.231
Liang ZA, Huang HX, Pardalos PM: Optimality conditions and duality for a class of nonlinear fractional programming problems. J. Optim. Theory Appl. 2001, 110: 611–619. 10.1023/A:1017540412396
Liang ZA, Huang HX, Pardalos PM: Efficiency conditions and duality for a class of multiobjective fractional programming problems. J. Glob. Optim. 2003, 27: 447–471. 10.1023/A:1026041403408
Ahmad I, Husain Z:Second order -convexity and duality in multiobjective programming. Inf. Sci. 2006, 176: 3094–3103. 10.1016/j.ins.2005.08.003
Ahmad I, Husain Z: Second order symmetric duality in multiobjective programming involving cones. Optim. Lett. 2012. doi:10.1007/s11590–012–0508–2; article in press
Mishra SK, Lai KK: Second-order symmetric duality in multiobjective programming involving generalized cone-invex functions. Eur. J. Oper. Res. 2007, 178: 20–26. 10.1016/j.ejor.2005.11.024
Agarwal RP, Ahmad I, Gupta SK: A note on higher-order nondifferentiable symmetric duality in multiobjective programming. Appl. Math. Lett. 2011, 24: 1308–1311. 10.1016/j.aml.2011.02.021
Suneja SK, Aggarwal S, Davar S: Multiobjective symmetric duality involving cones. Eur. J. Oper. Res. 2002, 141: 471–479. 10.1016/S0377-2217(01)00258-2
Khurana S: Symmetric duality in multiobjective programming involving generalized cone-invex functions. Eur. J. Oper. Res. 2005, 165: 592–597. 10.1016/j.ejor.2003.03.004
Acknowledgements
The authors wish to thank the referee for her/his valuable suggestions which have considerably improved the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally and significantly in writing this paper. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Gupta, S., Kailey, N. & Kumar, S. Duality for nondifferentiable multiobjective higher-order symmetric programs over cones involving generalized -convexity. J Inequal Appl 2012, 298 (2012). https://doi.org/10.1186/1029-242X-2012-298
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2012-298