Istituto di Scienza e Tecnologie dell'Informazione     
Adamowicz M. On determining a minimal set of linear constraints. Internal note IEI-B70-19, 1970.
When one considers large, complex linaer programming problems one frequently finds that a number of the constraints represent redundant or superfluous information. Methods are, of course, avaible for detecting and removing some of the superfluous constraints and for solving linear programming problems that still contain such constraints. However, it may at times be necessary to detect and remove all the superfluous constraints so as to obtain a minimal set of linear constraints. This paper describes a set of procedures for obtaining such a minimal set. The procedures make use of the constraints after the necessary slack and surplus variables have been added and can be adapted for use within the simplex procedure.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional