Advanced
DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (Hp, r)-INVEX FUNCTIONS†
DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (Hp, r)-INVEX FUNCTIONS†
Journal of Applied Mathematics & Informatics. 2014. Jan, 32(1_2): 99-111
Copyright © 2014, Korean Society of Computational and Applied Mathematics
  • Received : February 14, 2013
  • Accepted : April 11, 2013
  • Published : January 28, 2014
Download
PDF
e-PUB
PubReader
PPT
Export by style
Share
Article
Author
Metrics
Cited by
TagCloud
About the Authors
ANURAG JAYSWAL
I. AHMAD
ASHISH KUMAR PRASAD

Abstract
In this paper, we have taken step in the direction to establish weak, strong and strict converse duality theorems for three types of dual models related to multiojective fractional programming problems involving ( Hp , r )-invex functions. AMS Mathematics Subject Classification : 90C32, 90C46, 49N15.
Keywords
1. Introduction
Generalized convexity plays an important role in many aspects of optimization, such as optimality conditions, duality theorems, variational inequalities, saddle point theory and convergence of optimization algorithms, so the research on generalized convexity is one of the important aspects of mathematical programming problems.
The problem in which objective functions are ratio of two functions are termed as fractional programming problems. Such problems are studied in various fields like economics [3] , information theory [12] , heat exchange networking [24] and others. Duality in multiobjective fractional programming problems involving generalized convex functions have been of much interest in recent past, (see [4 , 5 , 8 , 14 , 16 , 18 , 22] ) and the references cited therein. For more information about fractional programming problems, the reader may consult the research bibliography compiled by Stancu-Minasian [19 , 20 , 21] .
Mukherjee [13] considered a multiobjective fractional programming problem and discussed the Mond-Weir type duality results under generalized convexity. Gulati and Ahmad [6] proved the duality results using Fritz John conditions for multiobjective programming problem involving generalized convex functions. Kaul et al . [9] derived duality results for a Mond-Weir type dual problem related to multiobjective fractional programming problem involving pseudolinear and η -pseudolinear functions. Osuna-Gómez et al . [15] focus his study to establish the optimality condition and duality theorems for a class of multiobjective fractional programs under generalized convexity assumptions by applying parametric approach.
The notion of convexity was not enough to meet the challenging demand of some problems on Economics and Engineering. To meet this demand the notion of invexity was introduced by Hanson [7] by substituting the linear term ( x y ) appearing in the definition of convex functions with an arbitrary vector valued function.
Antczak [2] introduced a new class of functions named ( p , r )-invex function, which is an extension of invex function. Recently, Jayswal et al . [8] focus his study on multiobjective fractional programming problems and derived sufficient optimality conditions and duality theorems involving ( p , r ) − ρ − ( η , θ )-invex functions [11] .
Yuan et al. [23] introduced new types of generalized convex functions and sets, which are called locally ( Hp , r , α )−pre-invex and locally Hp -invex sets. They obtained also optimality conditions and duality theorems for a scalar nonlinear programming problem. Recently, Liu et al. [10] proposed the concept of ( Hp , r )-invex function and focus his study to discuss sufficient optimality conditions to multiple objective programming problem and multiobjective fractional programming problem involving the aforesaid class of functions but no step was taken to prove the duality results involving ( Hp , r )-invex functions.
In this paper, viewing the importance of duality theorems in optimization theory, we establish weak, strong and strict converse duality theorems involving ( Hp , r )-invex function to three types of dual models related to mulitiobjective fractional programming problems. The organization of the remainder of this paper is as follows. The formulation of multiobjective fractional programming problem along with some definitions and notations related to ( Hp , r )-invexity is given in Section 2. Weak, strong and strict converse duality theorems for three types of dual models related to multiobjective fractional programming problem under ( Hp , r )-invexity are derived in Section 3 to Section 5. Finally, conclusions and further developments are given in Section 6.
2. Notation and Preliminaries
Throughout the paper, let Rn be the n -dimensional Euclidean space,
PPT Slide
Lager Image
Let x , y Rn . Then
PPT Slide
Lager Image
and x y .
Definition 2.1 ( [2] ). Let a 1 , a 2 > 0, λ ∈ (0, 1) and r R . Then the weighted r -mean of a 1 and a 2 is given by
PPT Slide
Lager Image
Definition 2.2 ( [23] ). X Rn is locally Hp -invex set if and only if, for any x , u X , there exist a maximum positive number a ( x , u ) ≤ 1 and a vector function Hp : X × X × [0,1] → Rn , such that
PPT Slide
Lager Image
PPT Slide
Lager Image
and Hp ( x , u ; λ) is continuous on the interval (0, a ( x , u )), where the logarithm and the exponentials appearing in the relation are understood to be taken componentwise.
Definition 2.3 ( [23] ). A function f : X R defined on a locally Hp -invex set X Rn is said to be locally ( Hp , r )-pre-invex on X if, for any x , u X , there exists a maximum positive number a ( x , u ) ≤ 1 such that
PPT Slide
Lager Image
where the logarithm and the exponentials appearing in the left-hand side of the inequality are understood to be taken componentwise. If u is fixed, then f is said to be ( Hp , r )-pre-invex at u . Correspondingly, if the direction of above inequality is changed to the opposite one, then f is said to ( Hp , r )-pre-incave on S or at u .
For convenience, we assume that X be a Hp -invex set, Hp is right differentiable at 0 with respect to the variable λ for each given pair x , u X , and f : X R is differential on X . The symbol
PPT Slide
Lager Image
denotes the right derivative of Hp at 0 with respect to the variable λ for each given pair x , u X ; ∇ f ( x ) ≜ (∇ 1 f ( x ), ...,∇ nf ( x )) T denotes the differential of f at x , and so
PPT Slide
Lager Image
Definition 2.4 ( [10] ). Let X be a Hp -invex set, Hp is right differentiable at 0 with respect to the variable λ for each given pair x , u X , and f : X R is differentiable on X . If for all x X , one of the relations
PPT Slide
Lager Image
hold, then f is said to be ( Hp , r )-invex (strictly ( Hp , r )-invex) at u X . If the above inequalities are satisfied at any point u X then f is said to be ( Hp , r )-invex (strictly ( Hp , r )-invex) on X .
We now consider the following multiobjective fractional programming problems:
(FP) Minimize
PPT Slide
Lager Image
subject to
PPT Slide
Lager Image
where f , g : X Rk and h : X Rm , f = ( f 1 , f 2 , ..., f k ), g = ( g 1 , g 2 , ..., g k ), h = ( h 1 , h 2 , ..., h m ), are differentiable functions on a (nonempty) Hp -invex set X . Without loss of generality, we can assume that fi ( x ) ≥ 0, gi ( x ) > 0, i = 1, 2, ..., k for all x X . Let X 0 = { x X : h ( x ) ≤ 0} be the set of all feasible solutions to (FP).
We denote
PPT Slide
Lager Image
and ϕ ( x ) = ( ϕ 1 ( x ), ϕ 2 ( x ), ..., ϕk ( x )).
Definition 2.5. A feasible solution x X 0 of (FP) is said to be an efficient solution of (FP) if there exist no other feasible solution x X 0 such that
PPT Slide
Lager Image
and
PPT Slide
Lager Image
It is well known (see, for example [17] ) that, if x X 0 is an efficient solution of a multiobjective fractional programming problem (FP), then the following necessary optimality conditions are satisfied:
Theorem 2.1 (Necessary optimality conditions). Let x X 0 be an efficient solution to a multiobjective fractional programming problem (FP) and h satisfies the constraints qualification [17] at x . Then, there exist
PPT Slide
Lager Image
such that
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
where
PPT Slide
Lager Image
The above conditions will be needed in the present analysis.
Remark 2.1 All the theorems in the subsequent parts of this paper will be proved only in the the case when r ≠ 0. The proofs in other cases are easier than in this one, since the differences arise only the form of inequality. Moreover, without loss of generality, we shall assume that r > 0 (in the case when r < 0, the direction some of the inequalities in the proof of the theorems should be changed to the opposite one).
3. Parametric duality
We consider the following parametric dual of (FP) as follows:
( DI ) Maximize v = ( v 1 , v 2 , ..., v k )
subject to
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
Theorem 3.1 (Weak duality). Let x X 0 be a feasible solution for (FP), and let ( u , y , z , v ) be a feasible solution for (DI). Moreover , we assume that any one of the following conditions holds:
  • (a)
  • (b)
Then
PPT Slide
Lager Image
Proof. If the condition (a) holds, then ( Hp , r )-invexity of S (.) at u , we have
PPT Slide
Lager Image
Using the fundamental property of exponential functions, the above inequality together with (7), imply that
PPT Slide
Lager Image
Now suppose contrary to the result that
PPT Slide
Lager Image
Then
PPT Slide
Lager Image
That is,
PPT Slide
Lager Image
The above inequalities along with (10) give
PPT Slide
Lager Image
By the feasibility of x and from (9) and (10), we have
PPT Slide
Lager Image
On adding (12) and (13), we obtain
PPT Slide
Lager Image
i.e.,
PPT Slide
Lager Image
which contradicts (11).
If condition ( b ) holds, the from the ( Hp , r )-invexity of Q (.) at u ,
PPT Slide
Lager Image
equivalently
PPT Slide
Lager Image
From (13) and (14), we get
PPT Slide
Lager Image
The above inequality together with (7) yields
PPT Slide
Lager Image
From the ( Hp , r )-invexity of P (.) at u , we have
PPT Slide
Lager Image
The inequalities (15) and (16), and the fundamental property of exponential functions imply that
PPT Slide
Lager Image
That is,
PPT Slide
Lager Image
Again if
PPT Slide
Lager Image
then we get (12) in the same way. But (12) contradicts (17). Therefore,
PPT Slide
Lager Image
This completes the proof.
Theorem 3.2 (Strong duality). Let x be an efficient solution for (FP) and let h satisfy the constraints qualification [17] at x . Then there exist y ∈ Ω, z Rm and v Rk such that ( x , y , z , v ) is feasible for (DI).
Also, if the weak duality theorem 3.1 holds for all feasible solutions of the problems (FP) and (DI), then ( x , y , z , v ) is an efficient solution for (DI) and the two objectives are equal at these points .
Proof. Since x is an efficient solution for (FP) and h satisfy the constraints qualification at x , there exist y ∈ Ω, z Rm and v Rk such that ( x , y , z , v ) satisfies (2)-(6). This, in turn, imply that ( x , y , z , v ) is feasible for (DI). From the weak duality theorem, for any feasible points ( x , y , z , v ) to (DI), the inequality
PPT Slide
Lager Image
holds. Hence we conclude that ( x , y , z , v ) is an efficient solution to (DI) and the objective functions of (FP) and (DI) are equal at these points. This completes the proof.
Theorem 3.3 (Strict converse duality). Assume that x and ( u , y , z , v ) be an efficient solution for (FP) and (DI), respectively with
PPT Slide
Lager Image
Assume that
PPT Slide
Lager Image
is strictly ( Hp , r )- invex at u . Then x = u ; that is , u is an efficient solution for (FP).
Proof. Suppose on the contrary that x u . From (8), (9) and (10), we get
PPT Slide
Lager Image
From the strictly ( Hp , r )-invexity of A (.), we have
PPT Slide
Lager Image
Using the fundamental property of exponential functions, the above inequality together with (7), imply that
PPT Slide
Lager Image
Since
PPT Slide
Lager Image
i.e.,
PPT Slide
Lager Image
By the feasibility of x and (10), we have
PPT Slide
Lager Image
Therefore, from (10), (20) and (21), we conclude that
PPT Slide
Lager Image
Hence from (19) and (22), we have A ( u ) < 0 which contradicts (18). Hence x = u . This completes the proof.
Remark 3.1 The function A (.) in Theorem 3.3 is expressed by the sum of the modified objective part
PPT Slide
Lager Image
of (FP) and its constraint part
PPT Slide
Lager Image
If B (.) is strictly ( Hp , r )-invex and C (.) is ( Hp , r )-invex then the Theorem 3.3 is still holds.
4. Parameter free duality
In this section, we take the following form of theorem 2.1:
Theorem 4.1 Let x be an efficient solution to (FP). Assume that h satisfies the constraints qualification at x . Then there exist
PPT Slide
Lager Image
such that
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
Now we consider the following parameter free dual problem to (FP):
(DII) Maximize
PPT Slide
Lager Image
subject to
PPT Slide
Lager Image
PPT Slide
Lager Image
Denote
PPT Slide
Lager Image
and
PPT Slide
Lager Image
Throughout this section, we assume
PPT Slide
Lager Image
and gi ( u ) > 0, for all i = 1, 2, ..., k .
Theorem 4.2 (Weak duality). Let x X 0 be a feasible solution for (FP) and let ( u , y , z ) be a feasible solution for (DII). Assume that
PPT Slide
Lager Image
is ( Hp , r )- invex at u . Then
PPT Slide
Lager Image
Proof. From ( Hp , r )-invexity of Θ(.) at u , we have
PPT Slide
Lager Image
Using the fundamental property of exponential functions, the above inequality together with (27), imply that
PPT Slide
Lager Image
i.e,
PPT Slide
Lager Image
Suppose contrary to the result that
PPT Slide
Lager Image
Then
PPT Slide
Lager Image
It follows that
PPT Slide
Lager Image
equivalently,
PPT Slide
Lager Image
PPT Slide
Lager Image
From the feasibility of x , gi ( u ) > 0 and (28), we have
PPT Slide
Lager Image
Therefore (30), implies
PPT Slide
Lager Image
i.e,
PPT Slide
Lager Image
which contradicts (29). This completes the proof.
Theorem 4.3 (Strong duality). Let x be an efficient solution for (FP) and let h satisfy the constraints qualification [17] at x . Then there exist y ∈ Ω and z Rm such that ( x , y , z ) is feasible to (DII).
Also, If the weak duality theorem 5.2 holds for all feasible solutions of the problem (FP) and (DII), then ( x , y , z ) is an efficient solution for (DII) and the two objectives are equal at these points .
Proof. Since x is an efficient solution for (FP) and h satisfy the constraints qualification at x , there exist y ∈ Ω and z ∗ ∈ Rm such that ( x , y , z ) satisfies (23)-(26). This, in turn, imply that ( x , y , z ) is feasible for (DII). From the weak duality theorem 4.2, for any feasible points ( x , y , z ) to (DII)), the inequality
PPT Slide
Lager Image
holds. Hence we conclude that ( x , y , z ) is an efficient solution to (DII) and the objective functions of (FP) and (DII) are equal at these points. This completes the proof.
Theorem 4.4 (Strict converse duality). Assume that x and ( u , y , z ) be an efficient solution for (FP) and (DII), respectively . Assume that
PPT Slide
Lager Image
is strictly ( Hp , r )- invex at u Then x = u ; that is , u is an efficient solution for (FP).
Proof. Suppose on the contrary that x u . From Theorem 4.3, we know that there exist
PPT Slide
Lager Image
and
PPT Slide
Lager Image
such that
PPT Slide
Lager Image
is an efficient solution for (DII) and
PPT Slide
Lager Image
By (24), (26) and (31), we obtain
PPT Slide
Lager Image
Hence
PPT Slide
Lager Image
From (28) and (33), we have
PPT Slide
Lager Image
By the feasibility of x , gi ( u ) > 0, from (28) and the above inequality, we have
PPT Slide
Lager Image
Therefore,
PPT Slide
Lager Image
That is,
PPT Slide
Lager Image
On the other hand, from strictly ( Hp , r )-invexity of U (.) at u , we have
PPT Slide
Lager Image
The above inequality together with (27) and the fundamental property of the exponential functions yields
PPT Slide
Lager Image
which contradicts inequality (34). Hence x = u ; that is, u is an efficient solution for (FP). This completes the proof.
5. Mond-Weir duality
In this section, we consider the following Mond-Weir dual to (FP):
(DIII) Maximize
PPT Slide
Lager Image
subject to
PPT Slide
Lager Image
PPT Slide
Lager Image
PPT Slide
Lager Image
Denote
PPT Slide
Lager Image
and Փ( u ) = (Փ 1 ( u ),Փ 2 ( u ), ...,Փ k ( u )).
Now we shall state weak, strong and strict converse duality theorems without proof as they can be proved in light of the Theorem 4.2, Theorem 4.3 and Theorem 4.4, proved in previous section.
Theorem 5.1 (Weak duality). Let x X 0 be a feasible solution for (FP) and let ( u , y , z ) be a feasible solution for (DIII). Assume that
PPT Slide
Lager Image
is ( Hp , r )- invex at u . Then
PPT Slide
Lager Image
Theorem 5.2 (Strong duality). Let x be an efficient solution for (FP) and let h satisfy the constraints qualification [17] at x . Then there exist y I and z Rm such that ( x , y , z ) is feasible to (DIII).
Also , If the weak duality theorem 5.1 holds for all feasible solutions of the problem (FP) and (DIII), then ( x , y , z ) is an efficient solution for (DIII) and the two objectives are equal at these points . Theorem 5.3 (Strict converse duality). Assume that x and ( u , y , z ) be an efficient solution for (FP) and (DIII), respectively . Assume that
PPT Slide
Lager Image
is strictly ( Hp , r )- invex at u . Then x = u ; that is , u is an efficient solution for (FP).
6. Conclusion
In this paper, we have used the concept of ( Hp , r )-invex functions to established duality results for three type of dual models related to multiobjective fractional programming problem. The question arise whether optimality and duality theorems established in this paper also holds under the assumption of ( Hp , r )-invexity for a class of minimax fractional programming problem considered in [1] .
BIO
Anurag Jayswal received M.A. and Ph.D from Banaras Hindu University, Varanasi–221 005, U.P., India. He is currently an Assistant Professor at Indian School of Mines, Dhanbad, India since 2010. His research interests include mathematical programming, nonsmooth analysis and generalized convexity.
Department of Applied Mathematics, Indian School of Mines, Dhanbad-826 004, India.
e-mail: anurag jais123@yahoo.com
I. Ahmad received M.Sc., M.Phil and Ph. D from Indian Institute of Technology, Roorkee, India. He is an Associate Professor at Aligarh Muslim University, India. Presently, he is on leave from Aligarh Muslim University and working as an Associate Professor at King Fahd University of Petroleum and Minerals, Saudi Arabia. His major areas of research interests are Mathematical Programming and Manifolds inclding generalizations of convexity, optimality crieteria, duality theory, geodesic convexity and continous-time programming. He is author and co-author of seventy research papers on previous mentioned field, published in journals of international repute.
Department of Mathematics, King Fahd University of Petroleum and Minerals, Saudi Arabia.
e-mail: drizhar@kfupm.edu.sa, izharmaths@hotmail.com
Ashish Kumar Prasad received M.Sc. from Vinoba Bhave University, Hazaribag-835001, Jharkhand, India and M.Phil from Indian School of Mines, Dhanbad-826004, India. After that, he joined Indian School of Mines, Dhanbad-826004, India, as a research scholar and presently he is working in the area of generalized convexity.
Department of Applied Mathematics, Indian School of Mines, Dhanbad-826 004, India.
e-mail: ashishprasa@gmail.com
References
Ahmad I. (2003) Optimality conditions and duality in fractional minimax programming involving generalized ρ-invexity Int. J. Manag. Syst. 19 165 - 180
Antczak T. (2001) (p, r)-invex sets and functions J. Math. Anal. Appl. 263 355 - 379    DOI : 10.1006/jmaa.2001.7574
Cambini A. , Castagnoli E. , Martein L. , Mazzoleni P. , Schaible S. (1990) Generalized convexity and fractional programming with economic applications, Lecture Notes in Economics and Mathematical Systems Springer-Verlag Berlin, New York
Chandra S. , Craven B. , Mond B. (1990) Vector-valued Lagrangian and multiobjective fractional programming duality Numer. Funct. Anal. Optim. 11 239 - 254    DOI : 10.1080/01630569008816373
Egudo R. R (1988) Multiobjective fractional duality Bull. Austral. Math. Soc. 37 367 - 388    DOI : 10.1017/S0004972700026988
Gulati T. R. , Ahmad I. (1998) Multiobjective duality using Fritz John conditions Asia-Pacific J. Oper. Res. 15 63 - 74
Hanson M. A. (1981) On sufficiency of the Kuhn-Tucker conditions J. Math. Anal. Appl. 80 545 - 550    DOI : 10.1016/0022-247X(81)90123-2
Jayswal A. , Kumar R. , Kumar D. (2012) Multiobjective fractional programming problems involving (p, r) − ρ − (η, θ)-invex function J. Appl. Math. Comput. 39 35 - 51    DOI : 10.1007/s12190-011-0508-x
Kaul R. N. , Suneja S. K. , Lalitha C. S. (1993) Duality in pseudolinear multiobjective fractional programming Indian J. Pure Appl. Math. 24 279 - 290
Liu X. , Yuan D. , Yang S. , Lai G. (2011) Multiple objective programming involving differentiable (Hp, r)-invex functions CUBO A Mathematical Journal 13 125 - 136    DOI : 10.4067/S0719-06462011000100008
Mandal P. , Nahak C. (2011) Symmetric duality with (p, r) − ρ − (η, θ)-invexity Appl. Math. Comput. 217 8141 - 8148    DOI : 10.1016/j.amc.2011.02.068
Meister B. , Oettli W. (1998) On the capacity of a Discrete Constant Channel Inform. Control 11 341 - 351    DOI : 10.1016/S0019-9958(67)90600-6
Mukherjee R. N. (1991) Generalized convex duality for multiobjective fractional programming J. Math. Anal. Appl. 162 309 - 316    DOI : 10.1016/0022-247X(91)90151-O
Mukherjee R. N. , Rao C. P. (1996) Multiobjective fractional programming under generalized invexity Indian J. Pure Appl. Math. 27 1175 - 1183
Osuna-Gómez R. , Rufióan-Lizana A. , Ruóiz-Canales P. (2000) Multiobjective fractional programming with generalized convexity Top 8 97 - 110    DOI : 10.1007/BF02564830
Preda V. , Stancu-Minasian I. M. , Beldiman M. , Stancu A. M. (2011) On a general duality model in multiobjective fractional programming with n-set functions Math. Comput. Model. 54 490 - 496    DOI : 10.1016/j.mcm.2011.02.039
Singh C. (1987) Optimality conditions in multiobjective differentiable programming J. Optim. Theory Appl. 53 115 - 123    DOI : 10.1007/BF00938820
Stancu-Minasian I. M. (1997) Fractional Programming: Theory, Methods and Applications Kluwer Academic Publishers Dordrecht, The Netherlands
Stancu-Minasian I. M. (1999) A fifth bibliograpy of fractional programming Optimization 45 343 - 367    DOI : 10.1080/02331939908844438
Stancu-Minasian I. M. (2006) A sixth bibliography of fractional programming Optimization 55 405 - 428    DOI : 10.1080/02331930600819613
Stancu-Minasian I.M. (2013) A seventh bibliography of fractional programming Advanced Modeling and Optimization 15 309 - 386
Weir T. (1986) A duality theorem for a multiobjective fractional optimization problem Bull. Aust. Math. Soc. 34 415 - 425    DOI : 10.1017/S0004972700010303
Yuan D. H. , Liu X. L. , Yang S. Y. , Nyamsuren D. , Altannar C. (2007) Optimality conditions and duality for nonlinear programming problems involving locally (Hp, r, α)-pre-invex functions and Hp-invex sets Int. J. Pure Appl. Math. 41 561 - 576
Zamora J. M. , Grossman I. E. (1998) MINLP model for heat exchanger network Comput. Chemi. Engin. 22 367 - 384    DOI : 10.1016/S0098-1354(96)00346-8