Abstract
An algorithm is developed which ranks the feasible solutions of an integer fractional programming problem in decreasing order of the objective function values.
Zusammenfassung
Es wird ein Algorithmus angegeben, der die zulässigen Lösungen eines ganzzahligen Quotientenprogrammes nach fallenden Zielfunktionswerten liefert.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chandra S, Chandramoham M (1979) An improved branch and bound method for mixed integer linear fractional programs, Zeitschrift für Angewandte Mathematik und Mechanik 59 (1979): 575–577.
Chandra S, Chandramoham M (1980) A note on integer linear fractional programming, Naval Research Logistics Quarterly 27: 171–174.
Martos B (1975) Nonlinear programming, Theory and Methods, North-Holland, Amsterdam.
Seshan CR, Tibekar VG (1980) Algorithms for integer fractional programming, Journal of the Indian Institute of Science Section B-Physical and Chemical Series 62: 9–16.
Swarup K (1965) Some aspects of linear fractional functionals programming, Australian Journal of Statistics 7: 90–104.
Salkin H (1975) Integer programming, Addison-Wiley, Reading Mass.,.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Verma, V., Bakhshi, H.C. & Puri, M.C. Ranking in integer linear fractional programming problems. ZOR - Methods and Models of Operations Research 34, 325–334 (1990). https://doi.org/10.1007/BF01416224
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01416224