Abstract
A new mixed type nondifferentiable higher-order symmetric dual programs over cones is formulated. As of now, in the literature, either Wolfe-type or Mond–Weir-type nondifferentiable symmetric duals have been studied. However, we present a unified dual model and discuss weak, strong, and converse duality theorems for such programs under higher-order - convexity/higher-order - pseudoconvexity. Self-duality is also discussed. Our dual programs and results generalize some dual formulations and results appeared in the literature. Two non-trivial examples are given to show the uniqueness of higher-order - convex/higher-order - pseudoconvex functions and existence of higher-order symmetric dual programs.
1. Introduction
The study of higher-order duality has computational advantages over the first-order duality when approximations are used, as it provides tighter bound for the value of the objective function. Mangasarian [1] formulated a class of higher-order duality in nonlinear problems. Later on, Mond and Zhang [2] obtained various higher-order duality results under higher-order invexity assumptions. Chen [3] discussed Mond–Weir-type higher-order symmetric duality involving F-convex functions, whereas Mishra [4] obtained Mond–Weir-type higher-order symmetric duality theorems under generalized invexity. Khurana [5] presented symmetric duality results for a Mond–Weir-type dual programs over arbitrary cones under cone-pseudoinvexity and strongly cone-pseudoinvexity. Later on, a higher-order Mond–Weir-type nondifferentiable multiobjective dual problem is formulated and established duality relations involving higher-order type-I fuctions by Ahmad et al. [6]. In [7], Gupta and Jayswal obtained multiobjective higher-order symmetric duality results under higher-order K-preinvexity/K-pseudoinvexity.
The theoretical and algorithmic concepts of mixed duality in nonlinear programming problems are interesting and useful. Under K-preinvexity and K-pseudoinvexity assumptions, Ahmad and Husain [8] formulated multiobjective mixed type symmetric dual programs over cones and proved duality results. Chandra et al. [9] studied mixed type symmetric duality results. Xu [10] proved duality theorems for two mixed type duals of a multiobjective programming problem. Yang et al. [11] presented mixed type symmetric duality for nondifferentiable nonlinear programming problems. By ignoring nonnegativity constraints of symmetric dual given in [12], Ahmad [13] presented multiobjective mixed type symmetric duality results. Recently, Verma et al. [14] formulated a higher-order nondifferentiable mixed symmetric dual model and duality results are studied under higher-order invexity/generalized invexity.
In the present paper, a new mixed type nondifferentiable higher-order symmetric dual programs over cones are formulated. As of now, in the literature, either Wolfe-type or Mond–Weir-type nondifferentiable symmetric dual programs have been discussed. However, our model unifies both dual programs. Under higher-order - convexity/higher-order - pseudoconvexity, appropriate duality theorems are proved. Self-duality is also discussed. Our study extends and generalizes the existing results appeared in [15,16,17,18,19,20,21]. Two non-trivial examples are given to show the uniqueness of higher-order - convex/higher-order - pseudoconvex functions and existence of higher-order symmetric dual programs.
2. Preliminaries
We consider the following nonlinear programming problem.
where and .
2.1. Definitions
- (a)
- The support function of E is given byThe subdifferential of is defined byThe normal cone for any convex set at a point is defined byIt is readily verified that for a compact convex set D, y is in if and only if
- (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 ,
The above definitions (d) and (e) are validated by the following example.
2.2. Example
Consider , and .
Now, we show that the function is a higher-order - pseudoconvex at and for all .
For , the above expression reduces to
Now,
At the above equality becomes
The Equations (1) and (2) show that function is a higher-order pseudoconvex at and for all (see Figure 1, Figure 2 and Figure 3).
Figure 1.
Graph of against x and u.
Figure 2.
Graph of against x.
Figure 3.
Graph of against x.
Now, we determine whether is a higher-order convex function.
At
which shows that the function is not a higher-order convex (see Figure 4) at and . This concludes that every higher-order convex function is a higher-order pseudoconvex function, but the converse is not necessarily true. (See Appendix A for codes of Figure 1, Figure 2, Figure 3 and Figure 4).
Figure 4.
Graph of against x.
3. Higher-Order Mixed Type Symmetric Duality over Cones
For N = {1, 2, 3, …, n} and H = {1, 2, 3, …, h}, let us assume and and , where denotes the number of elements in the set , also , and are defined similarly.
Again if , then and therefore is a zero-dimensional Euclidean space and is n-dimensional Euclidean space.
Now if and only if , i.e., . Similarly, any if and only if , i.e., . Let
- (i)
- ,
- (ii)
- ,
- (iii)
- ,
- (iv)
- ,
- (v)
- and
- (vi)
- be twice differentiable functions.
Now we formulate the following mixed type nondifferentiable higher-order symmetric dual programs over cones.
Primal Problem(MHP):
Dual Problem(MHD):
4. Remark
The above dual programs generalize several models that appeared in the literature can be seen below.
- (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
In this section, we establish the relations between primal problem (MHP) and dual problem (MHD).
Theorem 1.
(Weak Duality) Letbe feasible for (MHP) andbe feasible for (MHD). Suppose that
- (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)
Then
Proof.
From hypotheses (iii) and (iv), we get
and
Let
and
Now from hypotheses (vii) and (viii), we get
and
The above inequalities along with inequalities (7) and (14) imply that
and
The above inequalities along with Equations (18) and (19) give
and
Now adding the above two inequalities, we obtain
Noting that and we have
By taking
and
we have
and
The above two inequalities along with inequalities (5), (6), (12), and (13) give
and
which by hypotheses (i) and (ii) imply
and
Adding the above two inequalities, we obtain
Using and we have
Combining inequalities (20) and (21), we get
□
Theorem 2.
(StrongDuality)
Letbe an optimal solution of (MHP). Suppose that
- (i)
- is positive or negative definite matrix andis negative definite matrix,
- (ii)
- and
- (iii)
- and
- (iv)
- ,,and
Then,
- (I)
- is feasible for (MHD), and
- (II)
Furthermore, if the hypotheses of Theorem 1 are satisfied for all feasible solutions of (MHP) and (MHD), thenis an optimal solution for (MHD).
Proof.
As is an optimal solution of (MHP), by the Fritz John necessary optimality conditions [23,24], there exist , , , , such that the following conditions are satisfied at
Premultiplying Equations (26) and (27) by and , respectively, and then using Equations (28)–(32), we get
and
Using hypothesis (i) in (40), we get
Further, using inequalities (4), (8), and (39) in (41), we obtain
which on using hypothesis (i), we obtain
From Equations (26), (27), along with hypothesis (ii), we obtain
and
Now suppose, Then, Equations (43) and (45) give . The Equation (24) with hypothesis (ii) implies , and Equation (42) yields . Therefore, Equation (25) implies Thus , which contradicts the Equation (38). Therefore,
From Equations (28), (30) and (31), we have
which along with (42), gives
Using hypothesis (iii), we get
Further, from Equations (25), (37), and (43), we obtain
which by hypothesis (iii) and Equation (46) implies
Therefore, (42) and (43) reduce to
and
Now from Equations (24), (42), and (48) with hypotheses (ii) and (iv), we get
Therefore, Equation (52) implies
Now, Equations (22) and (23) along with (42), (43), (50) and hypothesis (iv), we obtain
and
Let then . Then above inequality (55) implies
Similarly,
Therefore,
If we take and , then satisfies the dual constraints (10)–(15). Therefore, it is feasible solution for (MHD).
Now from Equations (34), (46), (50), and (52), we get As is a compact convex set in ,
Moreover, since and then from Equations (33), (48), and (53), we obtain As is a compact convex set in ,
Therefore by Equations (35), (36), (48), (50), (61), (62), and hypothesis (iv), we get the equal objective functions value of (MHP) and (MHD) at and . From Theorem 1, we get that is an optimal solution for (MHD). □
Theorem 3.
(Converse Duality) Letbe an optimal solution of (MHD). Suppose that
- (i)
- is positive or negative definite matrix andis negative definite matrix,
- (ii)
- and
- (iii)
- and
- (iv)
- ,and
Then,
- (I)
- is feasible for (MHP), and
- (II)
Furthermore, if the hypotheses of Theorem 1 are satisfied for all feasible solutions of (MHP) and (MHD), thenis an optimal solution for (MHP).
Proof.
The proof follows on the line of Theorem 2. □
5.1. Self Duality
In general, primal problem (MHP) and dual problem (MHD) are not self-duals without including restrictions on and g. If we assume , , , , , are skew symmetric, that is,
and
By rewriting the dual problem (MHD) as a minimization problem, we get
subject to
As and g are skew symmetric, therefore
Now the above problem becomes:
subject to
which is identical to (MHP), that is, the objective function and the constraint functions of (MHP) and (MHD) are identical. Thus, (MHP) is a self-dual.
Thus, if is feasible for (MHP), then is feasible for (MHD) and vice versa.
The weak and strong duality theorems are verified by the following example.
5.2. Example
Let , , , and Then, the problems (MHP) and (MHD) are as follows.
Primal Problem(MHP):
Dual Problem(MHD):
where
- (i)
- ,
- (ii)
- and
- (iii)
- .
Let
Then, is feasible for (MHP) and is feasible for (MHD).
Now, is a higher-order - pseudo-convex function at with respect to and is a higher-order -pseudo-convex function at with respect to . Now, is a higher-order -convex function at with respect to . Similarly, is a higher-order -convex function at with respect to .
Also conditions (v) to (viii) of weak duality theorem (Theorem 1) are satisfied for Therefore, weak duality theorem is satisfied.
Furthermore,
- (i)
- is positive definite matrixandis negative definite matrix,
- (ii)
- (iii)
- and(As initially taken as zero).
- (iv)
- , , for .
Therefore, all the assumptions of strong duality theorem (Theorem 2) are also satisfied. Now objective function value is equal to .
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)
- Let , , , , and . Then, we obtain symmetric dual programs [29,30].
7. Conclusions
A new mixed type nondifferentiable higher-order symmetric dual programs over cones has been formulated. It is also shown the uniqueness of higher-order -convexity/higher-order -pseudoconvexity by a non-trivial example. Under these assumptions, the weak, strong, and converse duality theorems have been derived, and verified by an example. Self-duality has been also discussed. The presented programs and results generalize some existing duals and their corresponding theorems appeared in the literature. The symmetric duality between (MHP) and (MHD) can be extended for fractional and multiobjective programming problems over cones.
Author Contributions
All authors contributed equally and significantly in writing this article. All authors have read and agreed to the published version of the manuscript.
Funding
Deanship of Research, King Fahd University of Petroleum and Minerals, Saudi Arabia, Project No. IN171012.
Acknowledgments
The first and third authors would like to thank the King Fahd University of Petroleum and Minerals, Saudi Arabia to provide the financial support under the Internal Research Project no. IN171012. The authors are thankful to referees for their valuable suggestions which improved the results and presentation of this article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Mangasarian, O.L. Second and higher-order duality in nonlinear programming. J. Math. Anal. Appl. 1975, 51, 607–620. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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/).