Linear Programming with a Fractional Objective Function

1 February 1973

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 21 (1) , 22-29
https://doi.org/10.1287/opre.21.1.22

Abstract

This paper presents an algorithm, based on the simplex routine, that provides a way to solve a problem in which the objective function is not linear, but rather is represented by a ratio of two linear functions. This algorithm has a computational advantage over two previous ones because it requires neither variable transformations nor the introduction of new variables and constraints.

Keywords

ROUTINE
SIMPLEX
SOLVE
INTRODUCTION
PREVIOUS
CONSTRAINTS
FRACTIONAL OBJECTIVE FUNCTION

This publication has 0 references indexed in Scilit: