Mixed Type Nondifferentiable Higher-Order Symmetric Duality over Cones
Abstract
:1. Introduction
2. Preliminaries
2.1. Definitions
- (a)
- The support function of E is given by
- (b)
- Let C be a closed convex cone in with nonempty interior. The positive polar cone of C is given by
- (c)
- A function (where ) is sublinear in its third component, if for all
- (i)
- for all and
- (ii)
- for all for all
- (d)
- Reference [3] A function is called higher-order convex at with respect to if for all ,
- (e)
- Reference [3] A function is called higher-order pseudoconvex at with respect to if for all ,
2.2. Example
3. Higher-Order Mixed Type Symmetric Duality over Cones
- (i)
- ,
- (ii)
- ,
- (iii)
- ,
- (iv)
- ,
- (v)
- and
- (vi)
- be twice differentiable functions.
4. Remark
- (A)
- If and , then the above programs reduce to non-differentiable Wolfe-type dual programs (see [18]).
- (B)
- Let and . Then the above programs become non-differentiable Mond–Weir-type dual programs (see [18]).
- (C)
- Let and in (MHP) and (MHD), respectively. Then we get the programs proposed by Verma et al. [14].
- (D)
- Let , , and in (MHP) and (MHD), respectively. Then we get the programs discussed by Verma et al. [22].
5. Duality Theorems
- (i)
- is higher-orderpseudo-convex function atwith respect to,
- (ii)
- is higher-orderpseudo-convex function atwith respect to,
- (iii)
- is higher-orderconvex function atwith respect to,
- (iv)
- is higher-orderconvex function atwith respect to,
- (v)
- (vi)
- (vii)
- and
- (viii)
- (i)
- is positive or negative definite matrix andis negative definite matrix,
- (ii)
- and
- (iii)
- and
- (iv)
- ,,and
- (I)
- is feasible for (MHD), and
- (II)
- (i)
- is positive or negative definite matrix andis negative definite matrix,
- (ii)
- and
- (iii)
- and
- (iv)
- ,and
- (I)
- is feasible for (MHP), and
- (II)
5.1. Self Duality
5.2. Example
- (i)
- ,
- (ii)
- and
- (iii)
- .
- (i)
- is positive definite matrixandis negative definite matrix,
- (ii)
- (iii)
- and(As initially taken as zero).
- (iv)
- , , for .
6. Special Cases
- (i)
- Let , , , , and in (MHP) and (MHD). Then, we get the programs proposed by Verma and Gulati [21].
- (ii)
- If , , removed the higher-order and non-differentiable terms and omission of inequalities (6), (7), (13), and (14), then we get the model presented by Chandra et al. [9].
- (iii)
- Let and , , and . Then, our programs are reduced to the programs presented in [25].
- (iv)
- If , , , , , and omission of inequalities (7) and (14), then we get the dual programs discussed in [26].
- (v)
- If , , , , , and omission of inequalities (6) and (13), then we get the dual programs studied in [26].
- (vi)
- If , , , , , , and , and omission of inequalities (6) and (13), then we get the dual programs is equal to obtained in [27].For , , and omission of inequalities (6) and (13), we get the following special cases (vii) to (viii):
- (vii)
- If and , then we get the programs considered in [17].
- (viii)
- Let , , and . Then, our programs become the programs presented in [16].For , , and omission of inequalities (7) and (14), we get the following special cases (ix) to (xiii):
- (ix)
- If and , then we get the programs obtained in [15].
- (x)
- If , , and , then we get the dual programs derived in [19].
- (xi)
- If , , , , and , then we get the dual programs studied in [4].
- (xii)
- If , , , , and , then we get the dual programs presented in [28].
- (xiii)
7. Conclusions
Author Contributions
Funding
Acknowledgments
Conflicts of Interest
Appendix A
References
- Mangasarian, O.L. Second and higher-order duality in nonlinear programming. J. Math. Anal. Appl. 1975, 51, 607–620. [Google Scholar] [CrossRef] [Green Version]
- Mond, B.; Zhang, J. Higher-order invexity and duality in mathematical programming. In Generalized Convexity, Generalized Monotonicity: Recent Results; Crouzeix, J.P., Legaz, J.E.M., Volle, M., Eds.; Kluwer Academic: Dordrecht, The Netherlands, 1998; pp. 357–372. [Google Scholar]
- Chen, X. Higher-order symmetric duality in nondifferentiable multiobjective programming problems. J. Math. Anal. Appl. 2004, 290, 423–435. [Google Scholar] [CrossRef] [Green Version]
- Mishra, S.K. Nondifferentiable higher-order symmetric duality in mathematical programming with generalized invexity. Eur. Oper. Res. 2005, 167, 28–34. [Google Scholar] [CrossRef]
- Khurana, S. Symmetric duality in multiobjective programming involving generalized cone-invex functions. Eur. Oper. Res. 2005, 165, 592–597. [Google Scholar] [CrossRef]
- Ahmad, I.; Husain, Z.; Sharma, S. Higher-order duality in non-differentiable multiobjective programming. Numer. Funct. Anal. Optim. 2007, 28, 989–1002. [Google Scholar] [CrossRef]
- Gupta, S.K.; Jayswal, A. Multiobjective higher-order symmetric duality involving generalized cone-invex functions. Comput. Math. Appl. 2010, 60, 3187–3192. [Google Scholar] [CrossRef] [Green Version]
- Ahmad, I.; Husain, Z. Multiobjective mixed symmetric duality involving cones. Comput. Math. Appl. 2010, 59, 319–326. [Google Scholar] [CrossRef] [Green Version]
- Chandra, S.; Husain, I. On mixed symmetric duality in mathematical programming. Opsearch 1999, 36, 165–171. [Google Scholar] [CrossRef]
- Xu, Z. Mixed type duality in multiobjective programming problems. J. Math. Anal. Appl. 1996, 198, 621–635. [Google Scholar] [CrossRef] [Green Version]
- Yang, X.M.; Teo, K.L.; Yang, X.Q. Mixed symmetric duality in nondifferentiable mathematical programming. Indian J. Pure Appl. Math. 2003, 34, 805–815. [Google Scholar]
- Bector, C.R.; Chandra, S. On mixed symmetric duality in multiobjective programming. Opsearch 1999, 36, 399–407. [Google Scholar] [CrossRef]
- Ahmad, I. Multiobjective mixed symmetric duality with invexity. N. Z. J. Math. 2005, 34, 1–9. [Google Scholar]
- Verma, K.; Mathur, P.; Gulati, T.R. A new approach on mixed type nondifferentiable higher-order symmetric duality. J. Oper Res. Soc. China 2019, 7, 321–335. [Google Scholar] [CrossRef]
- Agarwal, R.P.; Ahmad, I.; Gupta, S.K.; Kailey, N. Generalized Second-order mixed symmetric duality in nondifferentiable mathematical programming. In Abstract and Applied Analysis; Hindawi: London, UK; New York, NY, USA, 2011; Volume 103597, 14p. [Google Scholar]
- Gulati, T.R.; Gupta, S.K. Wolfe-type second order symmetric duality in nondifferentiable programming. J. Math. Anal. Appl. 2005, 310, 247–253. [Google Scholar] [CrossRef] [Green Version]
- Gulati, T.R.; Gupta, S.K. Higher order nondifferentiable symmetric duality with generalized F-convexity. J. Math. Anal. Appl. 2007, 329, 229–237. [Google Scholar] [CrossRef] [Green Version]
- Gulati, T.R.; Verma, K. Nondifferentiable higher-order symmetric duality under invexity/generalized invexity. Filomat 2014, 28, 1661–1674. [Google Scholar] [CrossRef] [Green Version]
- Hou, S.H.; Yang, X.M. On second-order symmetric duality in nondifferentiable programming. J. Math. Anal. Appl. 2001, 255, 488–491. [Google Scholar] [CrossRef] [Green Version]
- Verma, K.; Gulati, T.R. Higher order symmetric duality using generalized invexity. In Proceedings of the 3rd International Conference on Operations Research and Statistics (ORS 2013), Singapore, 22–23 April 2013. [Google Scholar] [CrossRef]
- Verma, K.; Gulati, T.R. Wolfe-type higher-order symmetric duality under invexity. J. Appl. Math. Inform. 2014, 32, 153–159. [Google Scholar] [CrossRef]
- Verma, K.; Mathur, P.; Gulati, T.R. Mixed type higher order symmetric duality over cones. J. Model. Optim. 2017, 7, 1–7. [Google Scholar] [CrossRef] [Green Version]
- Schechter, M. More on subgradient duality. J. Math. Anal. Appl. 1979, 71, 251–262. [Google Scholar] [CrossRef] [Green Version]
- Suneja, S.K.; Agarwal, S.; Dawar, S. Multiobjective symmetric duality involving cones. Eur. Oper. Res. 2002, 141, 471–479. [Google Scholar] [CrossRef]
- Mond, B.; Schechter, M. Nondifferentiable symmetric duality. Bull. Aust. Math. Soc. 1996, 53, 177–188. [Google Scholar] [CrossRef] [Green Version]
- Gulati, T.R.; Gupta, S.K. Higher-order symmetric duality with cone constraints. Appl. Math. Lett. 2009, 22, 776–781. [Google Scholar] [CrossRef] [Green Version]
- Gulati, T.R.; Gupta, S.K.; Ahmad, I. Second-order symmetric duality with cone constraints. J. Comput. Appl. Math. 2008, 220, 347–354. [Google Scholar] [CrossRef] [Green Version]
- Gulati, T.R.; Ahmad, I.; Husain, I. Second-order symmteric duality with generalized convexity. Opsearch 2001, 38, 210–222. [Google Scholar] [CrossRef]
- Chandra, S.; Goyal, A.; Husain, I. On symmetric duality in mathematical programming with F-convexity. Optimization 1998, 43, 1–18. [Google Scholar] [CrossRef]
- Chandra, S.; Kumar, V. A note on pseudo-invexity and symmetric duality. Eur. J. Oper. Res. 1998, 105, 626–629. [Google Scholar] [CrossRef]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Share and Cite
Ahmad, I.; Verma, K.; Al-Homidan, S. Mixed Type Nondifferentiable Higher-Order Symmetric Duality over Cones. Symmetry 2020, 12, 274. https://doi.org/10.3390/sym12020274
Ahmad I, Verma K, Al-Homidan S. Mixed Type Nondifferentiable Higher-Order Symmetric Duality over Cones. Symmetry. 2020; 12(2):274. https://doi.org/10.3390/sym12020274
Chicago/Turabian StyleAhmad, Izhar, Khushboo Verma, and Suliman Al-Homidan. 2020. "Mixed Type Nondifferentiable Higher-Order Symmetric Duality over Cones" Symmetry 12, no. 2: 274. https://doi.org/10.3390/sym12020274