Dépôt Institutionnel de l'Université BBA

Étude théorique et numérique d’un algorithme de point intérieur de type correcteur-prédicteur pour la programmation linéaire.

Afficher la notice abrégée

dc.contributor.author AGDOUCHE, Fouzia
dc.contributor.author BENRAI, Feriel
dc.date.accessioned 2022-11-06T08:20:29Z
dc.date.available 2022-11-06T08:20:29Z
dc.date.issued 2022-06-30
dc.identifier.issn MTM/314
dc.identifier.uri https://dspace.univ-bba.dz:443/xmlui/handle/123456789/2263
dc.description.abstract Complexité polynomiale. • Abstract: In this work, we studied a primal-dual algorithm of interior points of corrector-predictor type based on a new search direction to solve a linear problem (LP ), we have introduce algebraic transformation on the equation of centrality xz = µe. By the study of Darvay(2020), ψ(t) = t − √ t who proved that the algorithm has polynomial complexity, we have done comparative numerical tests between the theoretical choice of the displacement step during the prediction phase and the alternative choice to see the in uence of these parameters on th en_US
dc.description.abstract Complexité polynomiale. • Abstract: In this work, we studied a primal-dual algorithm of interior points of corrector-predictor type based on a new search direction to solve a linear problem (LP ), we have introduce algebraic transformation on the equation of centrality xz = µe. By the study of Darvay(2020), ψ(t) = t − √ t who proved that the algorithm has polynomial complexity, we have done comparative numerical tests between the theoretical choice of the displacement step during the prediction phase and the alternative choice to see the in uence of these parameters on th en_US
dc.language.iso fr en_US
dc.publisher Université de Bordj Bou Arreridj Faculty of Mathematics and Computer Science en_US
dc.subject ue de cet algorithme. • Mots clés : Méthode de points interieurs, Programmation lineaire, Algorithme correcteur- predicteur, transfermation algébriqu en_US
dc.subject ue de cet algorithme. • Mots clés : Méthode de points interieurs, Programmation lineaire, Algorithme correcteur- predicteur, transfermation algébriqu en_US
dc.title Étude théorique et numérique d’un algorithme de point intérieur de type correcteur-prédicteur pour la programmation linéaire. en_US
dc.type Thesis en_US


Fichier(s) constituant ce document

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée

Chercher dans le dépôt


Recherche avancée

Parcourir

Mon compte