论文信息 - Ranking in integer linear fractional programming problems

Ranking in integer linear fractional programming problems

An algorithm is developed which ranks the feasible solutions of an integer fractional programming problem in decreasing order of the objective function values.ZusammenfassungEs wird ein Algorithmus angegeben, der die zulässigen Lösungen eines ganzzahligen Quotientenprogrammes nach fallenden Zielfunktionswerten liefert.

M. C. Puri | V. Verma | H. C. Bakhshi | V. Verma | H. Bakhshi

[1] K. Swarup. SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING , 1965 .

[2] S. Chandra,et al. An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs , 1979 .

[3] Bela Martos,et al. Nonlinear programming theory and methods , 1977 .

[4] Harvey M. Salkin,et al. Integer Programming , 2019, Engineering Optimization Theory and Practice.

[5] S. Chandra,et al. A note on integer linear fractional programming , 1980 .