Semi-infinite minimax fractional programming under (Φ, ρ)-V-invexity and generalised (Φ, ρ)-V-invexity. Optimality
by Tadeusz Antczak
International Journal of Operational Research (IJOR), Vol. 31, No. 2, 2018

Abstract: Semi-infinite minimax fractional programming problems with both inequality and equality constraints are considered. The sets of parametric sufficient optimality conditions for a new class of non-convex differentiable semi-infinite minimax fractional programming problems are obtained under (generalised) (Φ, ρ)-V-invexity assumptions imposed on the objective and constraint functions. With the reference to the said functions, we extend some results of optimality for a larger class of non-convex semi-infinite minimax fractional programming problems in comparison to those ones, previously established in the literature under other generalised convex notions.

Online publication date: Mon, 08-Jan-2018

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 Operational Research (IJOR):
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