Abstract
AbstractOne of the main computational problems faced in the optimal design of flexible chemical plants with multi‐period operation is the large number of decision variables that are involved in the corresponding nonlinear programming formulation. To overcome this difficulty, a decomposition technique based on a projection‐restriction strategy is suggested to exploit the block‐diagonal structure in the constraints. Successful application of this strategy requires an efficient method to find an initial feasible point, and the extension of current equation ordering algorithms for adding systematically inequality constraints that become active. General trends in the performance of the proposed decomposition technique are presented through an example.
Sign-in/Register to access full text options 
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.
