Title: Symmetric duality in non-differentiable programming using G-invexity

Authors: Ramu Dubey; S.K. Gupta

Addresses: Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee-247667, India ' Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee-247667, India

Abstract: 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.

Keywords: nonlinear programming; symmetric duality; support function; duality results; G-invexity.

DOI: 10.1504/IJMOR.2016.078828

International Journal of Mathematics in Operational Research, 2016 Vol.9 No.3, pp.395 - 407

Received: 16 Oct 2014
Accepted: 04 Jan 2015
Published online: 03 Sep 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article