The behavior of Jurík's nearest point approach algorithm on some 3-dimensional problems

.blurhash-client-img { display: none !important; }

Open Access

|Aug 2012

Abstract

In this note we highlight two issues with recently published Jurík's Nearest Point Approach algorithm for linear programming.

Jurík, T. A Nearest Point Approach Algorithm for a Class of Linear Programming problems, Journal of Applied Mathematics, Statistics and Informatics (JAMSI), 4, (2008), No. 2
Search in Google Scholar
Klee, V. and Minty G. J. How good is the simplex algorithm, in (O. Shisha, ed.), Proc. 3rd Symposium Inequalities, Academic Press, New York, (1972), pp. 159-175
Search in Google Scholar
Németh A. B., Németh S. Z. How to project onto an isotone projection cone, Linear Algebra and its Applications, 433, 1, (2010), pp. 41-51
Search in Google Scholar
Shor, N. Z. Minimization Methods for Non-differentiable Functions, Springer-Verlag, (1985)10.1007/978-3-642-82118-9
Search in Google Scholar
Šuch, O. Experimental behavior of Jurik's nearest point approach algorithm for linear programming, Communications, Scientific Letters of the University of Žilina, 1, vol. 12, (2010)10.26552/com.C.2010.1.55-57
Search in Google Scholar
Šuch, O. On Nearest Point Approach Algorithm of Jurík, International Conference on Computational Intelligence and Software Engineering, Wuhan (2011)
Search in Google Scholar