Skip to main content
Journal ArticleOPEN ACCESS

On ratio invexity in mathematical programming

Journal of Mathematical Analysis and Applications (1997) 205(2) 330-336
DOI: 10.1006/jmaa.1997.5180
29Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The nonlinear fractional programming problem is considered. The functions involved in the objective function and constraints are assumed to be invex and differentiable. It is shown that the ratio of invex functions is invex. Sufficient optimality and duality theorems are presented for an invex fractional programming problem. © 1997 Academic Press.

Cite

CITATION STYLE

APA

Khan, Z. A., & Hanson, M. A. (1997). On ratio invexity in mathematical programming. Journal of Mathematical Analysis and Applications, 205(2), 330–336. https://doi.org/10.1006/jmaa.1997.5180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free