A note to the paper 'An efficient algorithm for linear programming' of V Ch Venkaiah

Autor:	Joachim Käschel
Rok vydání:	1992
Předmět:	Push–relabel maximum flow algorithm Mathematical optimization Simplex algorithm Ramer–Douglas–Peucker algorithm General Mathematics Out-of-kilter algorithm Karmarkar's algorithm Algorithm design Quantum algorithm for linear systems of equations Criss-cross algorithm Mathematics
Zdroj:	Proceedings Mathematical Sciences. 102:155-158
ISSN:	0973-7685 0253-4142
Popis:	In Venkaiah [1] an algorithm for solving linear optimization problems based on the idea of the projective algorithm of Karmarkar, is proposed. The essential simplification in the new algorithm is the use of a fixed projection operator. In this way the algorithm requires onlyO(n2) operations to obtain a sufficient exact solution. In this note it is shown that in some special cases the algorithm of Venkaiah yields a feasible solution that is far from the optimal one.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b1ac399cd9e2c01a17735115f4fa7866 https://doi.org/10.1007/bf02836787 Zobrazit plný text záznamu Full text from SpringerLink