A practical comparison of penalty functions for globally solving mixed-integer nonlinear programming (MINLP) problems is presented. The penalty approach relies on the continuous relaxation of the MINLP problem by adding a specific penalty term to the objective function. A new penalty algorithm that addresses simultaneously the reduction of the error tolerances for optimality and feasibility, as well as the reduction of the penalty parameter, is designed. Several penalty terms are tested and different penalty parameter update schemes are analyzed. The continuous nonlinear optimization problem is solved by the deterministic DIRECT optimizer. The numerical experiments show that the quality of the produced solutions are satisfactory and that the selected penalties have different performances in terms of efficiency and robustness.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Fundação para a Ciência e Tecnologia, within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio
