An improving procedure of the interior projective method for linear programming

Autor:	D. Benterki, A. Leulmi
Rok vydání:	2008
Předmět:	Reduction (complexity) Computational Mathematics Mathematical optimization Projective method Linear programming Applied Mathematics Numerical analysis Projective algorithm Karmarkar's algorithm Criss-cross algorithm Interior point method Mathematics
Zdroj:	Applied Mathematics and Computation. 199:811-819
ISSN:	0096-3003
DOI:	10.1016/j.amc.2007.10.014
Popis:	We propose in this study, a practical modification of Karmarkar’s projective algorithm for linear programming problems. This modification leads to a considerable reduction of the cost and the number of iterations. This claim is confirmed by many interesting numerical experimentations.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2389d12b948ff39f48e879a73fa38676 https://doi.org/10.1016/j.amc.2007.10.014 Zobrazit plný text záznamu Full Text from ScienceDirect