Analysis of a class of fractional programming problems
type: Item
instance of: scholarly article
title: Analysis of a class of fractional programming problems
zbMATH Open document ID: 0676.90085
DOI: 10.1007/BF01582297
author: Moshe Sniedovich
published in: Mathematical Programming. Series A. Series B
publication date: 1989-01-01T00:00:00Z
review text: It is shown that subject to certain convexity conditions the optimal solution to the problem max g(x)/\(\phi\) (u(x)), \(x\in X\) can be obtained from the solution of the problem max g(x)\(+\lambda u(x)\), \(x\in X\), where \(\lambda\) is an exogenous parameter. A numerical example for the proposed procedure is given.
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 4108526
zbMATH Keywords: C-programming
zbMATH Keywords: convexity conditions
MaRDI profile type: Publication
cites work: Q3932576
cites work: On Nonlinear Fractional Programming
cites work: Parametric approaches to fractional programs
cites work: Q4051876
cites work: Fractional Programming. II, On Dinkelbach's Algorithm
cites work: Fractional programming
cites work: C-programming problems: A class of non-linear optimization problems
cites work: Analysis of a class of proxy problems
cites work: C-programming. An outline
cites work: C-programming and the minimization of pseudolinear and additive concave functions
cites work: A class of nonseparable dynamic programming problems
cites work: Maximal mean/standard deviation ratio in an undiscounted MDP
full work available at URL: https://doi.org/10.1007/bf01582297
OpenAlex ID: W2014693708
description: scientific article; zbMATH DE number 4108526