Minmax programming problems with (p, r) - ρ - (η, θ)-invexity
by P. Mandal; C. Nahak
International Journal of Mathematics in Operational Research (IJMOR), Vol. 5, No. 1, 2013

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.

Online publication date: Mon, 31-Mar-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com