Research Article
A New Technique for Determining Approximate Center of a Polytope
Table 4
Comparison of average number of iterations for higher dimensional random LPs.
| |||||||||||||||||||||||||||||||||||||||||||||
Note: here, is more than enough. If we observe the convergence pattern of CN-center, we can see that convergence is initially fast and gets slower in later iterations. Generally, we do not need exact central point; for practical purposes, any good central location is enough for working. So a good central point is obtainable by CN-center within just a few iterations for a 100 × 100 or even a very high dimensional problem. |