Conventionally, food is significantly over-processed to ensure safety. Dynamic optimization can be used to compute optimal thermal operation condition to ensure maximum product quality while assuring food safety. Local optimization (LO) algorithms have been used to compute optimal profiles. However, LO is not guaranteed to find the best solution for non-convex functions. We show that the problem can be formulated as a convex problem with a reverse convex constraint and we implement Tuy's algorithm to optimize globally. The method is deterministic and guaranteed to find the global optimum and therefore it is suitable to evaluate the effectiveness of local optimization to compute global optima. We compared the results of LO and global optimization (GO) to find that GO gives significantly better results for two and three heating time periods. However, for four periods the local optimizer catches up. This suggests that LO is good enough for this problem if we consider strategies with more than four periods implementable. However for many commercial processes less than four heating-cooling stages are used. @ 2008 Elsevier Ltd. All rights reserved.