Linear Programming with a Fractional Objective Function

Gabriel R. Bitran, Antônio Galvão Novaes

Operations Research · 1973 · 132 citations · 1 references

Concepts

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.

References

1