Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-45l2p Total loading time: 0 Render date: 2024-04-25T09:02:07.874Z Has data issue: false hasContentIssue false

11 - Multiperiod Blending

from Part III - Advanced Methods

Published online by Cambridge University Press:  01 May 2021

Christos T. Maravelias
Affiliation:
Princeton University, New Jersey
Get access

Summary

In the problems we have considered so far, we have either ignored the actual material consumption/production (sequential environments) or assumed that materials are consumed/produced at fixed proportions (network environments). There are problems, however, where the proportions in which materials are consumed can vary provided that some specifications are satisfied. This problem, which is termed multiperiod blending or simply blending, is fundamentally different from the ones discussed thus far because it leads to nonlinear models. There are two types of blending problems: (1) different streams/inputs are blended before they are processed/converted (process blending); and (2) streams/inputs are blended to produce final products (product blending). In Section 11.1, we introduce some preliminary concepts and a formal problem statement for product blending. In Section 11.2, we present two alternative formulations for product blending, and in Section 11.3, we present two approximate linear reformulations. We close, in Section 11.4, with a discussion of models for process blending. We focus on the equations necessary to account for the key new features of blending problems: (1) the selection of input materials and their blending in variable proportions, and (2) the requirement to satisfy given property specifications.

Type
Chapter
Information
Chemical Production Scheduling
Mixed-Integer Programming Models and Methods
, pp. 261 - 286
Publisher: Cambridge University Press
Print publication year: 2021

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Haverly, CA. Studies of the Behavior of Recursion for the Pooling Problem. SIGMAP Bull. 1978(25):1928.Google Scholar
Rajagopalan, S, Sahinidis, NV. The Pooling Problem. In Advances and Trends in Optimization with Engineering Applications, eds.  Terlaky, T, Anjos, MFAhmed, S. Philadelphia: Society for Industrial and Applied Mathematics; Mathematical Optimization Society, 2017; pp. 207217.Google Scholar
Kolodziej, S, Castro, PM, Grossmann, IE. Global Optimization of Bilinear Programs with a Multiparametric Disaggregation Technique. J Global Optim. 2013;57(4):10391063.Google Scholar
Lotero, I, Trespalacios, F, Grossmann, IE, Papageorgiou, DJ, Cheon, MS. An MILP-MINLP Decomposition Method for the Global Optimization of a Source Based Model of the Multiperiod Blending Problem. Comput Chem Eng. 2016;87:1335.Google Scholar
Kolodziej, SP, Grossmann, IE, Furman, KC, Sawaya, NW. A Discretization-Based Approach for the Optimization of the Multiperiod Blend Scheduling Problem. Comput Chem Eng. 2013;53:122142.Google Scholar
Gupte, A, Ahmed, S, Seok Cheon, M, Dey, S. Solving Mixed Integer Bilinear Problems Using MILP Formulations. SIAM Journal on Optimization. 2013; 23(2): 721744.CrossRefGoogle Scholar
Floudas, CA, Visweswaran, V. A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLPs – I. Theory. Comput Chem Eng. 1990;14(12):13971417.Google Scholar
Visweswaran, V, Floudas, CA. A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLPs – II. Application of Theory and Test Problems. Comput Chem Eng. 1990;14(12):14191434.Google Scholar
Adhya, N, Tawarmalani, M, Sahinidis, NV. A Lagrangian Approach to the Pooling Problem. Ind Eng Chem Res. 1999;38(5):19561972.CrossRefGoogle Scholar
Gounaris, CE, Misener, R, Floudas, CA. Computational Comparison of Piecewise – Linear Relaxations for Pooling Problems. Ind Eng Chem Res. 2009;48(12):57425766.Google Scholar
Misener, R, Thompson, JP, Floudas, CA. APOGEE: Global Optimization of Standard, Generalized, and Extended Pooling Problems via Linear and Logarithmic Partitioning Schemes. Comput Chem Eng. 2011;35(5):876892.CrossRefGoogle Scholar
Ceccon, F, Kouyialis, G, Misener, R. Using Functional Programming to Recognize Named Structure in an Optimization Problem: Application to Pooling. AlChE J. 2016;62(9):30853095.Google Scholar
Baltean-Lugojan, R, Misener, R. Piecewise Parametric Structure in the Pooling Problem: From Sparse Strongly-Polynomial Solutions to NP-Hardness. J Global Optim. 2018;71(4):655690.CrossRefGoogle ScholarPubMed
Castro, PM, Grossmann, IE. Global Optimal Scheduling of Crude Oil Blending Operations with RTN Continuous-Time and Multiparametric Disaggregation. Ind Eng Chem Res. 2014;53(39):1512715145.Google Scholar
Kelly, JD, Menezes, BC, Grossmann, IE. Distillation Blending and Cutpoint Temperature Optimization Using Monotonic Interpolation. Ind Eng Chem Res. 2014;53(39):1514615156.Google Scholar
Li, J, Karimi, IA, Srinivasan, R. Recipe Determination and Scheduling of Gasoline Blending Operations. AlChE J. 2010;56(2):441465.Google Scholar
Castro, PM. New MINLP Formulation for the Multiperiod Pooling Problem. AlChE J. 2015;61(11):37283738.Google Scholar
Castillo, PAC, Castro, PM, Mahalec, V. Global Optimization of Nonlinear Blend-Scheduling Problems. Engineering. 2017;3(2):188201.CrossRefGoogle Scholar
Mendez, CA, Grossmann, IE, Harjunkoski, I, Kabore, P. A Simultaneous Optimization Approach for Off-Line Blending and Scheduling of Oil-Refinery Operations. Comput Chem Eng. 2006;30(4):614634.Google Scholar
Kelly, JD, Mann, JL. Crude Oil Blend Scheduling Optimization: An Application with Multimillion Dollar Benefits. Part 2. The Ability to Schedule the Crude Oil Blendshop More Effectively Provides Substantial Downstream Benefits. Hydrocarbon Processing. 2003;82(7):7279.Google Scholar
Kelly, JD, Mann, JL. Crude Oil Blend Scheduling Optimization: An Application with Multimillion Dollar Benefits. Part 1. The Ability to Schedule the Crude Oil Blendshop More Effectively Provides Substantial Downstream Benefits. Hydrocarbon Processing. 2003;82(6):7279.Google Scholar
Kelly, JD. Logistics: The Missing Link in Blend Scheduling Optimization. Hydrocarbon Processing. 2006;85(6):4551.Google Scholar
Tawarmalani, M, Sahinidis, NV. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming : Theory, Algorithms, Software, and Applications. Dordrecht and Boston: Kluwer Academic Publishers; 2002. xxv, 475 p. p.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×