Described in this chapter, is a global optimization algorithm for mixed-integer nonlinear programming problems containing signomial functions. The method obtains a convex relaxation of the nonconvex problem through reformulations using single-variable transformations in combination with piecewise linear approximations of the inverse transformations. The solution of the relaxed problems converges to the global optimal solution as the piecewise linear approximations are improved iteratively. To illustrate how the algorithm can be used to solve problems to global optimality, a numerical example is also included.
CITATION STYLE
Lundell, A., & Westerlund, T. (2012). Global Optimization of Mixed-Integer Signomial Programming Problems (pp. 349–369). https://doi.org/10.1007/978-1-4614-1927-3_12
Mendeley helps you to discover research relevant for your work.