Second- and higher-order generalised invexity and duality in mathematical programming

S.K. Padhan and C. Nahak

International Journal of Mathematics in Operational Research, 2013, vol. 5, issue 2, 170-182

Abstract: We have introduced the second- and higher-order generalised invex functions and applied it to mathematical programming problems. Also, we have established many duality relations (weak, strong and converse duality) between the non-linear primal problem and their corresponding second- and higher-order dual problems. By taking different examples, we have shown, that second-order duality gives tighter bound than first-order duality. It has also been observed that the higher-order duality gives tighter bound than first- and second-order duality.

Keywords: second-order generalised invexity; higher-order generalised invexity; first-order duality; second-order duality; higher-order duality; mathematical programming. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=52459 (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:5:y:2013:i:2:p:170-182

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 ().