Experimental Behavior of Jurik's Nearest Point Approach Algorithm for Linear Programming
T. Jurik recently proposed a new algorithm for solving linear programming problems. The algorithm is iterative, finding points on the boundary of the problem's convex polyhedron. Global convergence of the algorithm is an open question. Jurik benchmarked the performance of the algorithm on stand...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2010-03-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-201001-0010_experimental-behavior-of-jurik-s-nearest-point-approach-algorithm-for-linear-programming.php |