- Research
- Open access
- Published:
Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
Journal of Inequalities and Applications volume 2013, Article number: 435 (2013)
Abstract
In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized -V-type I functions. Using the optimality conditions, we also investigate a parametric-type duality for multiobjective fractional programming problems concerning a generalized -V-type I function. Then some duality theorems are proved for such problems in the framework of generalized -V-type I functions.
MSC:90C46, 90C32, 90C30.
1 Introduction
Fractional programming problems have been studied with different characteristics of functions or diverse constraints. Singh has studied fractional programming problems since 1986. With convexity assumptions, Singh and Hanson [1] constituted not only sufficient conditions of Fritz John and Kuhn-Tucker type but also necessary conditions. Without convexity assumptions, Singh [2] also extended necessary conditions based on a constraint qualification. At the same time, Weir [3], under the concept of proper efficiency, transformed these problems into nondifferentiable functions and also established the duality theorems. Consequently, Kaul and Lyall [4] discussed the efficiency for fractional vector maximization problems and dual problems. Liu [5] derived the necessary conditions and duality for non-smooth, non-linear multiobjective fractional programming problems. He also established the duality results under generalized -convexity conditions. By applying Liu’s results, Bhatia and Garg [6] established Bector-type dual results for -convex functions. Then Bhatia and Pandey [7] further changed the components of the objective function to nonnegative, convex numerator, while the denominators were concave and positive.
The concept of -convexity, which was introduced by Preda [8], is as an extension of F-convexity and ρ-convexity that are defined by Hanson and Mond [9], and by Vial [10], respectively. Gulati et al. [11] defined the generalized -V-type I function-a generalization of convexity. It combines three components: the concepts of V-type I functions [12], -convex functions [13], and type I functions [14]. Then sufficient optimality conditions and dual programs were established in [11]. Indeed, since the vector-valued functions are not comparable, the concepts of efficiency and proper efficiency are very important in fractional vector optimization problems. Thus many authors have been studying those relevant problems to characterize the efficiency and proper efficiency of fractional vector optimization problems (cf. [1–20]). In [2], Singh derived the necessary conditions for efficient optimality of differentiable multiobjective programming under a constraint qualification. Using Singh’s results, Lee and Ho [20] derived the necessary optimality conditions for the efficiency to multiobjective fractional programming problems.
This paper consists of four sections. In Section 2, some definitions and results are recalled. In Section 3, we employ a necessary optimality condition with -V-type I functions to establish sufficient optimality conditions for multiobjective fractional programming problem (FP). Finally, in Section 4, a parametric dual problem of (FP) is performed by using the results in Section 3, and parametric duality theorems under the framework of generalized -V-type I functions are established.
2 Definitions and preliminaries
Let denote the n-dimensional Euclidean space, and let denote its nonnegative orthant. For any and , we define:
-
(1)
if and only if for all ;
-
(2)
if and only if for all ;
-
(3)
if and only if for all ;
-
(4)
if and only if and .
Let X be a nonempty open set in .
We consider the following multiobjective nonlinear fractional programming problem:
where , , and , , are differentiable functions. We assume that and for all , .
Denote by the feasible set of (FP).
Definition 1 A functional is sublinear in if for any ,
Definition 2 A function is said to be differentiable at x if there exists a linear transformation A of into such that
then we say that is differentiable at x, and we write
Here
-
1.
,
-
2.
and denote any norm in and , respectively,
-
3.
denotes the gradient of at x for .
For convenience, the symbols are stated as follows to define generalized -V-type I functions. Let and be the index sets. Let F be a sublinear functional. The functions and are differentiable at . Let , where , , and for , , and let be a pseudometric. Also, for , let and let denote the vector of active constraints at .
In order to approve the sufficient optimality conditions holding for problem (FP) and duality theorems holding with respect to primal problem (FP), the following definitions of -V-type I functions are required for the framework. The functions are the extensions of V-type I functions presented in [12] and type I functions presented in [14].
Definition 3 [11]
is said to be -V-type I at if there exist vectors α and , with for , , such that for each and for all , , we have
With the above definition, when the first inequality is satisfied as
then is said to be semistrictly -V-type I at .
Remark 1
-
(1)
If for , and , with , the inequalities become those V-type I functions introduced by Hanson et al. [12].
-
(2)
If , for , and , the definition of type I function given by Hanson and Mond [14] can be obtained.
Definition 4 [11]
is said to be quasi--V-type I at if there exists vector α and such that for each and for all , , we have
Definition 5 [11]
is said to be pseudo--V-type I at if there exists vector α and such that for each and for all , , we have
Definition 6 [11]
is said to be pseudo-quasi--V-type I at if there exists vector α and such that for each and for all , , we have
With the above definition, when the first inequality is satisfied as
then is said to be strictly pseudo-quasi--V-type I at .
Definition 7 [11]
is said to be quasi-pseudo--V-type I at if there exists vector α and such that for each and for all , , we have
With the above definition, when the second inequality is satisfied as
then is said to be quasi-strictly-pseudo--V-type I at .
Definition 8 [2]
A feasible solution of (FP) is said to be an efficient solution of (FP) if there does not exist any feasible solution x of (FP) such that
Definition 9 [2]
A feasible solution of (FP) is said to be a weakly efficient solution of (FP) if there does not exist any feasible solution x of (FP) such that
Definition 10 [2]
Let . The vector is called a convergent vector for Y at if and only if there exist a sequence in Y and a sequence of positive real numbers such that
Let denote the set of all convergent vectors for Y at .
We say that the constraint h of (FP) satisfies the constraint qualification at (see [2]) if
where is the set of all convergent vectors for at and , where .
3 Sufficient optimality conditions
The following theorem gives necessary optimality conditions for (FP) that are derived by Lee and Ho [20].
Theorem 1 ([20] Necessary optimality conditions)
Let be a (weakly) efficient solution of (FP). Assume that the constraint qualification (1) is satisfied for h at . Then there exist , , and such that satisfies
where .
In this section, we establish some sufficient optimality conditions for a (weakly) efficient solution, which are inverse of the above theorem with extra assumptions. Because of these extra assumptions, the correlative duality theorems are various. We deduce the fractional programming problem into a nonfractional programming problem by using the Dinkelbach transformation [21].
Theorem 2 (Sufficient optimality condition)
Let be a feasible solution of (FP), and let there exist , , satisfying conditions (2)~(6) at . Let
where . If
-
(a)
is -V-type I at on ,
-
(b)
,
-
(c)
,
then is a weakly efficient solution of problem (FP).
Proof Since is -V-type I at , we have
Since , , and , , the above inequalities along with the property of sublinearity of F give
From (c), (6), and the property of sublinearity of F, we get
Then
Now, by using (b), the above inequality becomes
If is not a weakly efficient solution for problem (FP), then there exists such that
From relation (6) and , we have
which contradicts (7). Hence, is a weakly efficient solution of (FP). □
Example Consider the following multiobjective nonlinear fractional programming problem:
where
-
1.
,
-
2.
,
-
3.
,
-
4.
.
The feasible region is .
By Theorem 2, we know
It can be seen that is -V-type I at for , , , , where , , , , , , , , , , . For , .
It is easy to see that the relations (b) and (c) in Theorem 2 are also satisfied at the point . Hence, is a weakly efficient solution.
Theorem 3 (Sufficient optimality condition)
Let be a feasible solution of (FP), and let there exist , , satisfying conditions (2)~(6) at . Let
where . If
-
(a)
is pseudo-quasi--V-type I at on ,
-
(b)
,
-
(c)
,
then is a weakly efficient solution of problem (FP).
Proof Assume that is not a weakly efficient solution of (FP). Then there is a feasible solution such that
From the above inequality, we have
From relation (6) and , for , we obtain
Also, , yield
By using (a), (8) and (9) imply
Summing up the two inequalities above and the property of sublinearity of F, we have
Using (b), we obtain
From relation (c), we get
which contradicts (10). Thus, the proof is complete. □
If the assumption of pseudo-quasi-type I in Theorem 3 above is replaced by the strictly pseudo-quasi-type I, the stronger conclusion that is an efficient solution of (FP) may be received. This result is stated as follows.
Theorem 4 (Sufficient optimality condition)
Let be a feasible solution of (FP), and let there exist , , satisfying conditions (2)~(6) at . Let
where . If
-
(a)
is strictly pseudo-quasi--V-type I at on ,
-
(b)
,
-
(c)
,
then is an efficient solution of problem (FP).
Theorem 5 (Sufficient optimality conditions)
Let be a feasible solution of (FP), and let there exist , , satisfying conditions (2)~(6) at . Let
where . If
-
(a)
is quasi-strictly-pseudo -V-type I at on ,
-
(b)
,
-
(c)
,
then is a weakly efficient solution of problem (FP).
Proof Assume that is not a weakly efficient solution of (FP). We have
Since (11), (12), and (a) hold,
and
From (c) and the property of sublinearity of F, it yields
From (14) and (b), we get
which contradicts (13). Thus, the proof is complete. □
4 Parametric duality theorem
In this section we give some weak, strong, converse duality relations between problems (D) and (FP). We consider the following parametric duality (D) of (FP).
Parametric duality results have been proven under generalized type I functions assumptions.
Theorem 6 (Weak duality)
Let x be a feasible solution of (FP), and let be a feasible solution of (D). Let
where . Assume that
-
(a)
is -V-type-I at u,
-
(b)
and for all ,
-
(c)
.
Then .
Proof Let x be a feasible solution of (FP), and let be a feasible solution of (D). By using (a), we have
Multiplying (19) by , , and (20) by , , summing over all i and j and using for , we get
Adding the two relations above and the property of sublinearity of F along with (15), we obtain
which by virtue of (c) implies
Suppose, on the contrary, that . It would exhibit a contradiction.
Assume that holds, from (17) and (b), we have
This contradicts (21) and the proof is completed. □
Suppose that is a weakly efficient solution of (FP). Using and the optimality conditions of (FP), we can find a feasible solution of (D). Furthermore, if we assume that some reasonable conditions are fulfilled, then (FP) and (D) have the same optimal value, and we have the following strong duality theorem.
Theorem 7 (Strong duality)
Let be a weakly efficient solution to problem (FP), and let the constraint qualification (1) be satisfied for h at . Then there exist , , and such that is a feasible solution of (D). If the hypotheses of Theorem 6 are fulfilled, then is a weakly efficient solution of (D) and their efficient values of (FP) and (D) are equal.
Proof Let be a weakly efficient solution of (FP). Then there exist , , and such that satisfies the relations (2)~(6). Hence, it is obtained that is a feasible solution of (D). If is not a weakly efficient solution of (D), then there exists a feasible solution of (D), and we have
It follows that , which contradicts the weak duality (Theorem 6). Hence is a weakly efficient solution of (D), and the efficient values of (FP) and (D) are clearly equal to their respective weakly efficient solution points. □
Theorem 8 (Strict converse duality)
Let and be weakly efficient solutions of (FP) and (D), respectively, with for all . Assume that the assumptions of Theorem 7 are fulfilled. Let
where .
Assume that
-
(a)
is semistrictly -V-type-I at with , , , ,
-
(b)
.
Then .
Proof Assume that . By (18), (a), and summing over i and j, we have
Adding the two inequalities above and the property of sublinearity of F along with (15), we obtain
which in view of (b) yields
Since
from relations (16), (17), and (18), we have
which contradicts (22). Hence, the proof is completed. □
References
Singh C, Hanson MA: Saddlepoint theory for nondifferentiable multiobjective fractional programming. J. Inf. Optim. Sci. 1986, 7: 41–48.
Singh C: Optimality conditions in multiobjective differentiable programming. J. Optim. Theory Appl. 1987, 53: 115–123. 10.1007/BF00938820
Weir T: Duality for nondifferentiable multiple objective fractional programming problems. Util. Math. 1989, 36: 53–64.
Kaul RN, Lyall V: A note on nonlinear fractional vector maximization. Opsearch 1989, 26: 108–121.
Liu JC: Optimality and duality for multiobjectional programming involving nonsmooth pseudoinvex functions. Optimization 1996, 37: 27–39. 10.1080/02331939608844194
Bhatia D, Garg PK:Duality for nonsmooth nonlinear fractional multiobjective programs via -convexity. Optimization 1998, 43: 185–197. 10.1080/02331939808844382
Bhatia D, Pandey S: A note multiobjective fractional programming. Cahiers Centre Études Rech. Opér. 1991, 33: 3–11.
Preda V: On efficiency and duality for multiobjective programs. J. Math. Anal. Appl. 1992, 166: 265–377.
Hanson MA, Mond B: Further generalizations 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. 1982, 8: 231–259.
Gulati TR, Ahmad I, Agarwal D: Sufficiency and duality in multiobjective programming under generalized type I functions. J. Optim. Theory Appl. 2007, 135: 411–427. 10.1007/s10957-007-9271-4
Hanson MA, Pini R, Singh C: Multiobjective programming under generalized type I invexity. J. Math. Anal. Appl. 2001, 261: 562–577. 10.1006/jmaa.2001.7542
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
Hanson MA, Mond B: Necessary and sufficient conditions in constrained optimization. Math. Program. 1987, 37: 51–58. 10.1007/BF02591683
Aghezza B, Hachimi M: Generalized invexity and duality in multiobjective programming problems. J. Glob. Optim. 2000, 18: 91–101. 10.1023/A:1008321026317
Ahmad I, Gulati TR:Mixed type duality for multiobjective variational problems with generalized -convexity. J. Math. Anal. Appl. 2005, 306: 669–683. 10.1016/j.jmaa.2004.10.019
Kim DS, Kim MH: Generalized type I invexity and duality in multiobjective variational problems. J. Math. Anal. Appl. 2005, 307: 533–554. 10.1016/j.jmaa.2005.02.018
Lai HC, Ho SC: Optimality and duality for nonsmooth multiobjective fractional programmings involving exponential V - r -invexity. Nonlinear Anal. 2012, 75: 3157–3166. 10.1016/j.na.2011.12.013
Lai HC, Ho SC: Duality for a system of multiobjective problems with exponential type invexity functions. J. Nonlinear Convex Anal. 2012, 13(1):97–110.
Lee JC, Ho SC: Optimality and duality for multiobjective fractional problems with r -invexity. Taiwan. J. Math. 2008, 82(3):719–740.
Göpfert A, Riahi H, Tammer C, Zălinescu C: Variational Methods in Partially Ordered Spaces. Springer, New York; 2003.
Acknowledgements
The author wish to thank the referees for their several valuable suggestions which have considerably improved the presentation of this article.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The author declares that they have no competing interests.
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
Ho, SC. Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions. J Inequal Appl 2013, 435 (2013). https://doi.org/10.1186/1029-242X-2013-435
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-435