In this paper a method to solve two different classes of low-rank gener- alized linear programs having a polyhedral feasible region is described. The method is based on the so called “optimal level solutions”. From an algorith- mic point of view, the behaviour of the method changes when it is applied to the first class of programs or to the second one. The reasons of such a different behaviour are pointed out and discussed.
Algorithmic aspects of a solution method for two low-rank generalized linear programs
CAMBINI, RICCARDO;SODINI, CLAUDIO
2009-01-01
Abstract
In this paper a method to solve two different classes of low-rank gener- alized linear programs having a polyhedral feasible region is described. The method is based on the so called “optimal level solutions”. From an algorith- mic point of view, the behaviour of the method changes when it is applied to the first class of programs or to the second one. The reasons of such a different behaviour are pointed out and discussed.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.