In this paper two algorithms are suggested for solving a linear fractional problem whatever the feasible region is. Such algorithms can be interpreted as a modified version of Martos and Charnes-Cooper algorithms. Successively, it will be shown that the two methods are algorithmically equivalent in the sense that they generate the same finite sequence of points leading to an optimal solution. This last result can be viewed as an extension of the one given by Wagner-Yuan for a compact feasible region.
Equivalence in linear fractional programming
MARTEIN, LAURA;CAMBINI, ALBERTO
1992-01-01
Abstract
In this paper two algorithms are suggested for solving a linear fractional problem whatever the feasible region is. Such algorithms can be interpreted as a modified version of Martos and Charnes-Cooper algorithms. Successively, it will be shown that the two methods are algorithmically equivalent in the sense that they generate the same finite sequence of points leading to an optimal solution. This last result can be viewed as an extension of the one given by Wagner-Yuan for a compact feasible region.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.