Minmax programming problems with (p, r) - ρ - (η, θ)-invexity

P. Mandal and C. Nahak

International Journal of Mathematics in Operational Research, 2013, vol. 5, issue 1, 121-143

Abstract: In this paper, we establish the sufficient optimality conditions for minmax programming and generalized fractional minmax programming problems. Based on the sufficient conditions, a duality model is constructed and duality results are derived under a new type of generalised invexity assumption, called (p, r) - ρ - (η, θ)-invexity. Our study extends some of the previously known results in the framework of generalised invexity and duality models. We also provide some examples to illustrate our work.

Keywords: generalised invexity assumption; minmax programming; minmax fractional programming; Schaible dual; weak converse duality; strong converse duality; strict converse duality; optimality conditions. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=50516 (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:1:p:121-143

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