Results 231 to 240 of about 84,165 (291)

On Fractional Programming

OPSEARCH, 1999
Programming problem with linear constraints and the objective function as the sum of the functions of the form $${f_1}\left( x \right) + \frac{1}{{{g_1}\left( x \right)}}$$ where f1(x) and g1(x) are linear, is reduced to a fractional programming problem.
Sinha, S. M., Tuteja, G. C.
openaire   +1 more source

Fractional Programming

2006
Single-ratio and multi-ratio fractional programs in applications are often generalized convex programs. We begin with a survey of applications of single-ratio fractional programs, min-max fractional programs and sum-of-ratios fractional programs. Given the limited advances for the latter class of problems, we focus on an analysis of min-max fractional ...
Frenk, J.B.G., Schaible, S.
openaire   +1 more source

Fractional Programming. I, Duality

Management Science, 1976
This paper, which is presented in two parts, is a contribution to the theory of fractional programming, i.e., maximization of quotients subject to constraints. In Part I a duality theory for linear and concave-convex fractional programs is developed and related to recent results by Bector, Craven-Mond, Jagannathan, Sharma-Swarup, et al.
openaire   +2 more sources

On Nonlinear Fractional Programming

Management Science, 1967
The main purpose of this paper is to delineate an algorithm for fractional programming with nonlinear as well as linear terms in the numerator and denominator. The algorithm presented is based on a theorem by Jagannathan (Jagannathan, R. 1966.
openaire   +1 more source

Multiple Objective Linear Fractional Programming

Management Science, 1981
This paper presents a simplex-based solution procedure for the multiple objective linear fractional programming problem. By (1) departing slightly from the traditional notion of efficiency and (2) augmenting the feasible region as in goal programming, the solution procedure solves for all weakly efficient vertices of the augmented feasible region. The
Jonathan S. H. Kornbluth, Ralph E. Steuer   +1 more
openaire   +1 more source

Markov Renewal Programming by Linear Fractional Programming

SIAM Journal on Applied Mathematics, 1966
Markov renewal programming is treated by linear fractional programming. Particular attention is given to the resolution of tied policies that minimize expected cost per unit time. The multichain case is handled by a decomposition approach.
openaire   +2 more sources

Fractional Programming with Homogeneous Functions

Operations Research, 1974
This paper extends the well known results for linear fractional programming to the class of programming problems involving the ratio of nonlinear functionals subject to nonlinear constraints, where the constraints are homogeneous of degree one and the functionals are homogeneous of degree one to within a constant. Two rather general auxiliary problems
Bradley, Stephen P., Frey, Sherwood C. jun.   +1 more
openaire   +2 more sources

Solving linear fractional bilevel programs

Operations Research Letters, 2004
The authors give a geometrical characterization of the optimal solution to the linear fractional bilevel programming (LFBP) problem in terms of what is called a boundary feasible extreme point. It is assumed that the second level optimal solution sets are singletons. The results extend the characterization proved by \textit{Y. H. Liu} and \textit{S. M.
Calvete, Herminia I., Galé, Carmen
openaire   +2 more sources

Fractional programming revisited

European Journal of Operational Research, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Fractional Programming

Zeitschrift für Operations Research, 1983
Schaible, Siegfried, Ibaraki, Toshihide
openaire   +3 more sources