Abstract
In the present paper an algorithm, based on cutting plane approach, is developed which seeks all the efficient r-tuples to multi-criteria integer linear fractional programming problem. A single objective integer linear fractional programming problem with any one of the objectives is considered and a cutting plane technique is used to this single objective programming problem. The cut developed in the present paper scans and truncates whole of an edge of the feasible region. The numerical illustrations are included in support of the algorithm developed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
