Symmetric duality in non-differentiable programming using G-invexity

Ramu Dubey and S.K. Gupta

International Journal of Mathematics in Operational Research, 2016, vol. 9, issue 3, 395-407

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. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=78828 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:9:y:2016:i:3:p:395-407

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().