Rein ganzzahlige lineare quotientenoptimierung nach dem schnittverfahren von gomory 1
- 1 January 1975
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik
- Vol. 6 (1) , 33-53
- https://doi.org/10.1080/02331887508801199
Abstract
This paper deals with the Gomory all-integer algorithm and its modification to obtain integer solutions to linear fractional functionals programming (L.F.F.P.). First, we sholve a non integer L.F.F.P.-problem, then we define linear substitutional objective functions and derive important properties of them. we find the integer solution to the L.F.F.P.-problem by solving linear programming problems with these substitutinal objective functions. All cases, in which the integer L.F.F.P.-problem has a solution, are described and th4 algorithms, to find the optimal integer solution, are given. We can see, that there are more cases, in which the integer L.F.F.P.-problem has a solution than in finding a solution of the L.F.F.P.-problem due to Martos.Keywords
This publication has 4 references indexed in Scilit:
- Letter to the Editor—Linear Fractional Functionals ProgrammingOperations Research, 1965
- SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMINGAustralian Journal of Statistics, 1965
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958