The present paper deals with the problem of maximizing the ratio of two linear functions subject to a set of linear equalities and nonnegativity constraints on the variables. The problem is attacked ...

The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...