On quasiconvexity in fractional programming

  • Bykadorov I
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The purpose of this paper is to obtain quasiconcavity criteria for sums of linear fractional functions (SLFF) and for some fractional functions of more general type. The classes of SLFF are characterized for which the known necessary quasiconvexity condition (namely, the positive semidefiniteness of the second-order derivatives on a subspace) is also sufficient. These results are extended to the class of functions which can be represented as the ratio of polynomials of several variables. Thus the known quasiconvexity criteria for quadratic and cubic functions are essentially supplemented. The simplificated representations of quasiconvex SLFF is obtained; this allows to extend the known classes of quasiconvex SLFF.

Cite

CITATION STYLE

APA

Bykadorov, I. A. (1994). On quasiconvexity in fractional programming (pp. 281–293). https://doi.org/10.1007/978-3-642-46802-5_22

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