A New Approach For Solving All Integer Linear Fractional Programming Problem
Abstract views: 37 / PDF downloads: 30
Keywords:
Fractional programming, Simplex method, Dual simplex method, Gomorys fractional cut methodAbstract
In this paper we present a new approach for solving all integer linear fractional programming problem (ILFPP) in which the objective function is a linear fractional function, and where the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon simplex method as well as dual simplex method. A simple example is given to clarify the theory of this new approach.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.