This paper presents an Equality Relaxation variant to the Outer-Approximation algorithm for solving mixed-integer nonlinear programming (MINLP) problems that arise in structural optimization of process flowsheets. The proposed algorithm has the important capability of being able to explicitly handle nonlinear equations within MINLP formulations that have linear integer variables and linear/nonl...

This paper focuses on minimizing the annual operative costs in monopolar DC distribution networks with inclusion of solar photovoltaic (PV) generators while considering a planning period 20 years. problem is formulated through mixed-integer nonlinear programming (MINLP) model, which binary variables define nodes where PV must be located, and continuous are related to power flow solution optimal...

This paper contributes with a new two-stage optimization methodology to solve the problem of optimal placement and sizing solar photovoltaic (PV) generation units in medium-voltage distribution networks. The is formulated mixed-integer nonlinear programming (MINLP) model, where it combines binary variables regarding nodes PV generators will be located continuous associated power flow solution. ...

Abstract Different versions of polyhedral outer approximation are used by many algorithms for mixed-integer nonlinear programming (MINLP). While it has been demonstrated that such methods work well convex MINLP, extending them to solve nonconvex problems traditionally challenging. The Supporting Hyperplane Optimization Toolkit (SHOT) is a solver based on approximations the feasible set MINLP pr...

Large-scale strongly nonlinear and nonconvex mixed-integer programming (MINLP) models frequently appear in optimization-based process synthesis, integration, intensification, control. However, they are usually difficult to solve by existing algorithms within acceptable time. In this study, we propose two robust homotopy continuation enhanced branch bound (HCBB) (denoted as HCBB-FP HCBB-RB) wher...