Semi-infinite minimax fractional programming under (Φ, ρ )- V -invexity and generalised (Φ, ρ )- V -invexity. Optimality

Tadeusz Antczak

International Journal of Operational Research, 2018, vol. 31, issue 2, 164-197

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.

Keywords: semi-infinite minimax fractional programming; (Φ, ρ )- V -invex function; (Φ, ρ )- V -pseudo-invex function; (Φ, ρ )- V -quasi-invex function; optimality conditions. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=89128 (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:ijores:v:31:y:2018:i:2:p:164-197

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().