- It is a very clever n-dimensional generalization of binary search
- Khachiyan's method takes approximately the same time for all cases. Simplex algorithm is either very fast, for most cases or very slow for some cases.
- Khachiyan's method seems to use very high precision arithmetic, the cost of which the logarithmic cost measure underestimates
No comments:
Post a Comment