Symmetric Duality In Nondifferentiable Programming Research Articles

A New Approach on Mixed-Type Nondifferentiable Higher-Order Symmetric Duality

In this paper, a new mixed-type higher-order symmetric duality in scalar-objective programming is formulated. In the literature we have results either Wolfe or Mond–Weir-type dual or separately, while in this we have combined those results over one model. The weak, strong and converse duality theorems are proved for these programs under $$\eta $$ -invexity/ $$\eta $$ -pseudoinvexity assumptions. Self-duality is also discussed. Our results generalize some existing dual formulations which were discussed by Agarwal et al. (Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming. Abstr. Appl. Anal. 2011. https://doi.org/10.1155/2011/103597 ), Chen (Higher-order symmetric duality in nonlinear nondifferentiable programs), Gulati and Gupta (Wolfe type second order symmetric duality in nondifferentiable programming. J. Math. Anal. Appl. 310, 247–253, 2005, Higher order nondifferentiable symmetric duality with generalized F-convexity. J. Math. Anal. Appl. 329, 229–237, 2007), Gulati and Verma (Nondifferentiable higher order symmetric duality under invexity/generalized invexity. Filomat 28(8), 1661–1674, 2014), Hou and Yang (On second-order symmetric duality in nondifferentiable programming. J Math Anal Appl. 255, 488–491, 2001), Verma and Gulati (Higher order symmetric duality using generalized invexity. In: Proceeding of 3rd International Conference on Operations Research and Statistics (ORS). 2013. https://doi.org/10.5176/2251-1938_ORS13.16 , Wolfe type higher order symmetric duality under invexity. J Appl Math Inform. 32, 153–159, 2014).

Symmetric duality in non-differentiable programming using G-invexity

Mond-Weir and Wolfe type non-differentiable primal and dual symmetric problems in mathematical programming are formulated. In this paper, we use a generalisation of convexity, namely G-invexity, to prove weak, strong and converse duality relations for the two non-differentiable symmetric programming problems. Some previous known results for symmetric programming problems turn out to be special cases of the results established in the paper.

Symmetric duality in non-differentiable programming using G-invexity

Mond-Weir and Wolfe type non-differentiable primal and dual symmetric problems in mathematical programming are formulated. In this paper, we use a generalisation of convexity, namely G-invexity, to prove weak, strong and converse duality relations for the two non-differentiable symmetric programming problems. Some previous known results for symmetric programming problems turn out to be special cases of the results established in the paper.

Wolfe type second-order symmetric duality in nondifferentiable programming

A pair of Wolfe type second-order symmetric dual programs involving nondifferentiable functions is considered and appropriate duality theorems are established under η 1 -bonvexity/ η 2 -boncavity. Several known results including that of Mond and Gulati et al. are obtained as special cases.

On Second-Order Symmetric Duality in Nondifferentiable Programming

This article is concerned with a pair of second-order symmetric dual non-differentiable programs and second-order F-pseudo-convexity. We establish the weak and the strong duality theorems for the new pair of dual models under the F-pseudo-convexity assumption. Several known results including Mond and Schechter, as well as others are obtained as special cases.