Abstract
Process synthesis problems involving uncertainty can be mathematically represented as multiparametric mixed integer nonlinear programming (mp-MINLP) models. In this paper, we present an outer-approximation algorithm for the solution of such mp-MINLPs, described by convex process models, linear in the vectors of binary variables and uncertain parameters. The algorithm follows decomposition principles, i.e., constructing a converging sequence of valid upper and lower bounds through the solution of parametric primal and master subproblems. The solution is characterized in different sub-domains of the uncertain parameter space by (i) linear parametric profiles, and (ii) the corresponding integer solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
