The behavior of Jurík's nearest point approach algorithm on some 3-dimensional problems
By: Ondrej ŠUCH
Open Access
|Aug 2012References
- Jurík, T. A Nearest Point Approach Algorithm for a Class of Linear Programming problems,(JAMSI), 4, (2008), No. 2
- Klee, V. and Minty G. J. How good is the simplex algorithm, in (O. Shisha, ed.), Proc. 3Symposium Inequalities, Academic Press, New York, (1972), pp. 159-175
- Németh A. B., Németh S. Z. How to project onto an isotone projection cone,, 433, 1, (2010), pp. 41-51
- Shor, N. Z., Springer-Verlag, (1985)
- Šuch, O. Experimental behavior of Jurik's nearest point approach algorithm for linear programming,, 1, vol. 12, (2010)
- Šuch, O. On Nearest Point Approach Algorithm of Jurík, International Conference on Computational Intelligence and Software Engineering, Wuhan (2011)
DOI: https://doi.org/10.2478/v10294-012-0004-4 | Journal eISSN: 1339-0015 (formerly 1336-9180) | Journal ISSN: 1336-9180
Language: English
Page range: 43 - 47
Published on: Aug 13, 2012
Published by: University of Ss. Cyril and Methodius in Trnava
In partnership with: Paradigm Publishing Services
Keywords:
Related subjects:
© 2012 Ondrej ŠUCH, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons License.