- Research
- Open access
- Published:
Symmetric duality for nondifferentiable multiobjective fractional variational problems involving cones
Journal of Inequalities and Applications volume 2013, Article number: 434 (2013)
Abstract
We introduce a pair of symmetric dual problems for nondifferentiable multiobjective fractional variational problems with cone constraints over arbitrary cones. On the basis of weak efficiency, we obtain symmetric duality relations for Mond-Weir-type problems under invexity and pseudoinvexity assumptions. Our symmetric duality results extend and improve some known results in Mishra et al. (J. Math. Anal. Appl. 333:1093-1110, 2007) to the cone constraints.
MSC:90C29, 90C32, 90C26.
1 Introduction
The notion of symmetric duality in nonlinear programming, in which the dual of the dual is the primal, was first introduced by Dorn [1]. Dantzig et al. [2] discussed symmetric dual programs and established a symmetric duality under the convexity-concavity assumption. Mond and Hanson [3] first formulated a pair of symmetric dual variational problems by providing continuous analogue of the symmetric dual pair of Dantzig et al. [2] and proved the usual duality theorems under the convexity-concavity assumption. Suneja et al. [4] formulated a pair of Wolfe-type multiobjective symmetric dual programs over arbitrary cones, in which the objective function is optimized with respect to an arbitrary closed convex cone by assuming the functions involved to be cone-convex. Later on, Khurana [5] formulated a pair of Mond-Weir-type multiobjective symmetric dual programs over arbitrary cones and derived the symmetric duality theorems involving cone-pseudoinvex and strongly cone-pseudoinvex functions. Recently, Kim and Kim [6] extended the results of Suneja et al. [4] and Khurana [5] to nondifferentiable multiobjective symmetric dual programs for weak efficiency involving cone-invex and cone-pseudoinvex functions. Very recently, Ahmad et al. [7] extended the results of Suneja et al. [4] and Khurana [5] to a pair of multiobjective mixed symmetric dual programs over arbitrary cones. On the other hand, Chandra et al. [8] first introduced a symmetric duality in nonlinear fractional programming. Mond and Schechter [9] studied nondifferentiable symmetric duality, in which the objective function contains a support function. Following Mond and Schechter [9], Yang et al. [10] presented a pair of symmetric dual nonlinear fractional programming problems and established duality theorems under pseudo-convexity/pseudo-concavity assumptions on the kernel function. Further, Gulati et al. [11] generalized these results to static and continuous nonlinear fractional programming. For the multiobjective case of static nonlinear fractional program, symmetric duality was established under convexity assumptions. Subsequently, Gulati et al. [12] and Kim and Lee [13] gave two pairs of multiobjective symmetric dual variational programs, in which duality results were obtained under pseudoconvexity-pseudoconcavity and invexity assumptions, respectively. Chen [14] and Kim et al. [15] discussed duality results for multiobjective symmetric fractional variational programs involving invex functions. Recently, Mishra et al. [16] gave a symmetric dual pair for a class of nondifferentiable multiobjective fractional variational problems. Weak, strong, converse and self-duality relations were established under certain invexity assumptions. Recently, Ahmad et al. [17] formulated a pair of multiobjective fractional variational symmetric dual problems over cones and established duality theorems. Weak, strong and converse duality theorems are established under the generalized F-convexity assumptions. In this paper, we introduce a pair of symmetric duals for nondifferentiable multiobjective fractional variational problems with cone constraints over arbitrary cones. On the basis of weak efficiency, we obtain symmetric duality relations for Mond-Weir-type problems under invexity and pseudo-invexity assumptions. Our duality results extend the results in Mishra et al. [16] to the cone constraints over arbitrary cones with weak efficiency.
2 Preliminaries and notations
The following convention for vectors x and y in will be used:
Throughout this paper, we will use the following notations.
Let be a real interval, let , be continuously differentiable functions. In order to consider , where is differentiable with derivative , denote the partial derivatives of f by
Let denote the space of continuous functions , with the uniform norm; is the cone of nonnegative functions in . Denote by X the space of piecewise smooth functions , with the norm , where the differentiation operator D is given by
where α is a given boundary value: thus except at discontinuities. For each , let be a positive semidefinite matrix with continuous on I, and the symbol T denotes the transposition.
Consider the following multiobjective fractional variational problem:
where .
Assume that and for all . Let X denote the set of all feasible solutions of (FVP).
Definition 2.1 (1) A point is said to be an efficient (Pareto optimal) solution of (FVP) if there exists no other feasible point such that
-
(2)
A point is said to be a properly efficient solution of (FVP) if it is efficient for (FVP) and if there exists a scalar such that, for all ,
for some such that
whenever and
-
(3)
A point is said to be a weakly efficient solution of (FVP) if there exists no other feasible point such that
Now we recall the invexity for continuous case as follows.
Definition 2.2 The vector of functionals is said to be invex in x and if for each , with piecewise smooth, there exists a function such that
for all , , where is piecewise smooth on .
Definition 2.3 The vector of functionals is said to be invex in y and if for each , with piecewise smooth, there exists function such that ,
for all , , where is piecewise smooth on .
Definition 2.4 The vector of functionals is said to be pseudo-invex in x and if for each , with piecewise smooth, there exists a function such that ,
for all , , where is piecewise smooth on .
Definition 2.5 The vector of functionals is said to be pseudo-invex in y and if for each , with piecewise smooth, there exists a function such that ,
for all , , where is piecewise smooth on .
We consider the problem of finding functions and , where is piecewise smooth on , to solve the following pair symmetric dual problems for nondifferentiable multiobjective fractional variational problems as follows.
where and are continuously differentiable functions, , () are a compact convex set in and , () are a compact convex set in , and are closed convex cones in , with nonempty interiors, respectively. and are positive polar cones of and , respectively, and . Let , . Then is a convex function and , where is the subdifferential of . Let
and
Let , , etc. All the statements above for , , and will be assumed to hold for subsequent results. It is to be noted that
and, consequently,
In order to simplify the notations we introduce
and
and express problems (NFVP) and (NFVD) equivalently as follows.
In the problems (NFVP)′ and (NFVD)′ above, it is to be noted that p and q are also nonnegative.
3 Duality theorems
In this section, we state duality theorems for problems (NFVP)′ and (NFVD)′, which lead to corresponding relations between (NFVP) and (NFVD). We establish weak, strong and converse duality relations between (NFVP)′ and (NFVD)′.
Theorem 3.1 (Weak duality)
Let be feasible for (NFVP)′, and let be feasible for (NFVD)′. Assume that is pseudo-invex in x and with respect to and is pseudo-invex in y and with respect to , with and , except possibly at corners of or . Then .
Proof From (11) and , we get
From (12),
Since is pseudo-invex with respect to , it follows that
Since , , and , , (15) can be written as
From (4) and , we get
From (5),
By pseudo-invexity of with respect to , we get
Since , , and , ,
From (16) and (17), we get
From (3) and (10), (18) yields
Suppose, if possible, that for all i, then from , and , , we have
which contradicts (19), hence . □
Consider the following multiobjective fractional variational problem.
where is a continuously differentiable function, is a continuously differentiable function. Let A = {, , , , , }.
We need the following Fritz John necessary optimality condition in order to establish a strong duality theorem. Using the proof of Theorem 1 in [18], we obtain the following theorem.
where are functions defined on , , are functions defined by , are functions defined by and are functions defined by and . Let .
Theorem 3.2 Let be a weakly efficient solution of (VP). Suppose that there exists an such that , , and the map is surjective. Then there exist , and piecewise smooth , , and , , satisfying
for all .
Theorem 3.3 (Strong duality)
Let be a weakly efficient solution for (NFVP)′ and fix in (NFVD)′, and define , . Suppose that all the conditions in weak duality are fulfilled. Furthermore, assume that
implies that , , and
is linearly independent.
Then there exist , , such that is weakly efficient solution of (NFVD)′.
Proof Since is a weakly efficient solution of (NFVP)′, by Theorem 3.2, there exist , , , , piecewise smooth and such that
Multiplying (22) by ,
Using the result in equality (23) and (29), we get
Since , , , and hence
Which by virtue of the hypothesis (II) yields
From (22) along with (35), we obtain
By hypothesis (III),
If , then (36) implies that and using (35) . From (20), we get , and from (21) and using (23), we get that , which contradicts (34). Hence and . Hence by (35), . By (21), (35) and , ,
Since . By multiplying both sides of equation (37) by , hence from (30) we get,
Equation (26) with implies that
By (25) and the fact that , , . Since , and so , hence , . By (24) and the fact that , , . Since , , and so , hence , . Thus, from (31), (32) and , , , equation (38) implies
and
Thus is feasible for (NFVD)′, and the objective values of (NFVP)′ and (NFVD)′ are equal there. Clearly, is weakly efficient for (NFVD)′. If is not weakly efficient for (NFVD)′, then for some feasible of (NFVD)′, there exist , such that , with , . Since , , it follows that , which contradicts by weak duality, equation (19). Thus is a weakly efficient solution of (NFVD)′. Hence the result holds. □
Theorem 3.4 (Converse duality)
Let be a weakly efficient solution for (NFVD)′ and fix in (NFVP)′, and define
Suppose that all the conditions in weak duality are fulfilled. Furthermore, assume that
implies that , , and
is linearly independent.
Then there exist , , such that is weakly efficient solution of (NFVP)′.
Proof It is analogous to the proof of the lines of Theorem 3.3. □
Remark 3.1 (1) When , then the support functions and inner products in the problems (NFVP) and (NFVD) in the draft disappear, and hence (NFVP) and (NFVD) in the draft collapse to (P) and (D) in the paper of Ahmad, Sharma (EJOR, Vol. 188, 2008, pp. 695-704) [19].
-
(2)
When , and , then the problems (NFVP) and (NFVD) reduce to those considered by Mishra et al. [16], respectively.
References
Dorn WS: A symmetric dual theorem for quadratic programs. J. Oper. Res. Soc. Jpn. 1960, 2: 93–97.
Dantzig GB, Eisenberg E, Cottle RW: Symmetric dual nonlinear programs. Pac. J. Math. 1965, 15: 809–812. 10.2140/pjm.1965.15.809
Mond B, Hanson MA: Symmetric duality for variational problems. J. Math. Anal. Appl. 1968, 23: 161–172. 10.1016/0022-247X(68)90124-8
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
Kim MH, Kim DS: Non-differentiable symmetric duality for multiobjective programming with cone constraints. Eur. J. Oper. Res. 2008, 188: 652–661. 10.1016/j.ejor.2007.05.005
Ahmad I, Husain Z: Multiobjective mixed symmetric duality involving cones. Comput. Math. Appl. 2010, 59(1):319–326. 10.1016/j.camwa.2009.03.117
Chandra S, Craven BD, Mond B: Symmetric dual fractional programming. Z. Oper.-Res. 1985, 29: 59–64.
Mond B, Schechter M: Nondifferentiable symmetric duality. Bull. Aust. Math. Soc. 1996, 53: 177–188. 10.1017/S0004972700016890
Yang XM, Teo KL, Yang XQ: Symmetric duality for a class of nonlinear fractional programming problems. J. Math. Anal. Appl. 2002, 271: 7–15. 10.1016/S0022-247X(02)00042-2
Gulati TR, Husain I, Ahmed A: Symmetric duality with invexity in static and continuous fractional programming. Optimization 1997, 40: 41–56. 10.1080/02331939708844297
Gulati TR, Husain I, Ahmed A: Symmetric duality for multiobjective variational problems. J. Math. Anal. Appl. 1997, 210: 22–38. 10.1006/jmaa.1997.5330
Kim DS, Lee WJ: Symmetric duality for multiobjective variational problems with invexity. J. Math. Anal. Appl. 1998, 218: 34–48. 10.1006/jmaa.1997.5730
Chen X: Symmetric duality for the multiobjective fractional variational problem with partial invexity. J. Math. Anal. Appl. 2000, 245: 105–123. 10.1006/jmaa.2000.6739
Kim DS, Lee WJ, Schaible S: Symmetric duality for invex multiobjective fractional variational problems. J. Math. Anal. Appl. 2004, 289: 505–521. 10.1016/j.jmaa.2003.08.035
Mishra SK, Wang SY, Lai KK: Symmetric duality for a class of nondifferentiable multi-objective fractional variational problems. J. Math. Anal. Appl. 2007, 333: 1093–1110. 10.1016/j.jmaa.2006.11.054
Ahmad I, Sharma S: Symmetric duality for multiobjective fractional variational problems involving cones. Eur. J. Oper. Res. 2008, 188: 695–704. 10.1016/j.ejor.2007.05.018
Chandra S, Craven BD, Husain I: A class of nondifferentiable continuous programming problems. J. Math. Anal. Appl. 1985, 107: 122–131. 10.1016/0022-247X(85)90357-9
Ahmad I: Symmetric duality for multiobjective fractional variational problems with generalized invexity. Inf. Sci. 2006, 176: 2192–2207. 10.1016/j.ins.2005.04.002
Acknowledgements
This work was supported by the Research Grant of Pukyong National University (2013). The authors wish to thank the anonymous referees for their suggestions and comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
DSK introduced a pair of symmetric dual problems for nondifferentiable multiobjective fractional variational problems with cone constraints and established symmetric duality relations for Mond-Weir-type problems under invexity and pseudoinvexity assumptions. YMK and MHK carried out the symmetric duality studies for nondifferentiable multiobjective fractional variational problems, participated in the sequence alignment and drafted the manuscript. All authors read and approved the final manuscript.
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
Kang, Y.M., Kim, D.S. & Kim, M.H. Symmetric duality for nondifferentiable multiobjective fractional variational problems involving cones. J Inequal Appl 2013, 434 (2013). https://doi.org/10.1186/1029-242X-2013-434
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-434