Documents disponibles écrits par cet auteur

The conversion of linear programmes to network flow problems / Mustapha Kemal Rahmouni

Public ISBD Titre : The conversion of linear programmes to network flow problems Type de document : texte imprimé Auteurs : Mustapha Kemal Rahmouni, Auteur ; H. P. Williams, Directeur de thèse Editeur : Southampton : [s.n.] Année de publication : 1987 Importance : 152 f. Présentation : ill. Format : 30 cm Note générale : PhD Thesis : Mathematics : University of Southampton : 1987 Bibliogr. f. 126 - 134 Langues : Anglais (eng) Mots-clés : Conversion Linear  programmes Network Flow  problems Index. décimale : D002387 Résumé : The research carried out throughout this thesis is concerned with the conversion of linear programmes to network flow problems. Although a network flow problem can always be expressed as a linear programme, the converse is not always true. Many people have found that some classes of linear programmes were in fact 'hidden' network flow problems, but few have actually put forward a systematic way of testing if any linear programme can be successfully converted to a network flow problem. The algorithm proposed in this thesis directly attempts to contruct the graph associated with the constraint matrix of the original LP programme. If a graph can be produced, then row operations and column scaling are carried out to actually yield, if possible, the equivalent network flow model. If a graph cannot be constructed, then the LP is not convertible to a NFP. The conversion of linear programmes to network flow problems [texte imprimé] / Mustapha Kemal Rahmouni, Auteur ; H. P. Williams, Directeur de thèse . - Southampton : [s.n.], 1987 . - 152 f. : ill. ; 30 cm. PhD Thesis : Mathematics : University of Southampton : 1987 Bibliogr. f. 126 - 134 Langues : Anglais (eng) Mots-clés : Conversion Linear  programmes Network Flow  problems Index. décimale : D002387 Résumé : The research carried out throughout this thesis is concerned with the conversion of linear programmes to network flow problems. Although a network flow problem can always be expressed as a linear programme, the converse is not always true. Many people have found that some classes of linear programmes were in fact 'hidden' network flow problems, but few have actually put forward a systematic way of testing if any linear programme can be successfully converted to a network flow problem. The algorithm proposed in this thesis directly attempts to contruct the graph associated with the constraint matrix of the original LP programme. If a graph can be produced, then row operations and column scaling are carried out to actually yield, if possible, the equivalent network flow model. If a graph cannot be constructed, then the LP is not convertible to a NFP.

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Spécialité	Etat_Exemplaire
D002387	D002387	Papier	Bibliothèque centrale	Thèse de Doctorat	Disponible