Second order duality for non-differentiable minimax programming problems involving generalised α-type-I functions
by Anurag Jayswal; Krishna Kummari
International Journal of Mathematics in Operational Research (IJMOR), Vol. 6, No. 3, 2014

Abstract: In this paper, we focus our study on a non-differentiable minimax programming problem and its two types of second order dual models. We establish weak, strong and strict converse duality theorems under the assumptions of generalised second-order α-type I functions.

Online publication date: Sat, 28-Jun-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