Abstract
In this chapter, we discuss the parallel implementation of the GOP algorithm, as studied by Androulakis et al. (1996), and we present distributed computing results for indefinite quadratic programming problems and for large-scale pooling problems that arise in chemical refineries. Section 7.1 focuses on the critical components of the distributed implementation of the GOP approach. Section 7.2 presents the computational results for large-scale indefinite quadratic problems. Finally, section 7.3 discusses the computational performance of the parallel GOP approach for large-scale blending and pooling problems.
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.
