Mixed-integer nonlinear programming (MINLP) problems have been intensively studied in the last decades due to its theoretical interest and its wide applicability. Several strategies and software for solving nonconvex MINLP problems have been proposed. Although many optimization approaches have been developed for MINLP problems, these methods can only find a local or approximate solution or use too many extra binary variables and constraints to reformulate the problem. Therefore, this study proposes a method for solving an MINLP problem in engineering optimization to obtain a global solution. The MINLP problem is transformed into a convex mixed-integer program by the convexification strategies and piecewise linearization techniques. A global optimum of the MINLP problem can then be found within the tolerable error. Numerical examples are also presented to demonstrate the effectiveness of the proposed method.
Mixed-integer nonlinear programming (MINLP) problems have been intensively studied in the last decades due to its theoretical interest and its wide applicability. Several strategies and software for solving nonconvex MINLP problems have been proposed. Although many optimization approaches have been developed for MINLP problems, these methods can only find a local or approximate solution or use too many extra binary variables and constraints to reformulate the problem. Therefore, this study proposes a method for solving an MINLP problem in engineering optimization to obtain a global solution. The MINLP problem is transformed into a convex mixed-integer program by the convexification strategies and piecewise linearization techniques. A global optimum of the MINLP problem can then be found within the tolerable error. Numerical examples are also presented to demonstrate the effectiveness of the proposed method.