Abstract

AbstractA decomposition technique is applied to address the simultaneous scheduling and optimal control problem of multigrade polymerization reactors. The simultaneous scheduling and control (SSC) problem is reformulated using Lagrangean decomposition as presented by Guignard and Kim. The resulting model is decomposed into scheduling and control subproblems, and solved using a heuristic approach used before by Van den Heever et al. in a different kind of problem. The methodology is tested using a methyl methacrylate (MMA) polymerization system, and the high impact polystyrene (HIPS) polymerization system, with one continuous stirred‐tank reactor (CSTR), and with a complete HIPS polymerization plant composed of a train of seven CSTRs. In these case studies, different polymer grades are produced using the same equipment in a cyclic schedule. The results of the heuristic decomposition technique are compared against those obtained by solving the problem without decomposition, whenever both solutions were available. The presence of a duality gap for the decomposed solution is observed as expected when integer variables and other nonconvexities are present. Computational times in the first two examples were lower for the decomposition heuristic than for the direct solution in full space, and the optimal solutions found were slightly better. The example related to the full scale HIPS plant was only solvable using the decomposition heuristic. © 2007 American Institute of Chemical Engineers AIChE J, 2008

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 call

Disclaimer: 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.