PM Castro - Computers & Chemical Engineering, 2015 - Elsevier
We address nonconvex bilinear problems where the main objective is the computation of a tight lower bound for the objective function to be minimized. This can be obtained through a …
In this paper, we present a brief overview of enterprise-wide optimization and challenges in multiscale temporal modeling and integration of different models for the levels of planning …
In this paper, we present the derivation of the multiparametric disaggregation technique (MDT) by Teles et al.(J. Glob. Optim., 2011) for solving nonconvex bilinear programs. Both …
Operations research (OR) is a branch of mathematical sciences that aims to utilize mathematical modeling, statistical analysis, and mathematical optimization systematically to …
In this paper, we introduce a new generalized multiperiod scheduling version of the pooling problem to represent time varying blending systems. A general nonconvex MINLP …
This paper addresses the modeling of crude oil operations in refineries assuming that all properties blend linearly. Guidelines are given on how to generate a Resource-Task …
PM Castro - Journal of Global Optimization, 2016 - Springer
A key element for the global optimization of non-convex mixed-integer bilinear problems is the computation of a tight lower bound for the objective function being minimized …
T Karia, CS Adjiman, B Chachuat - Computers & Chemical Engineering, 2022 - Elsevier
This paper revisits the approach of transforming a mixed-integer polynomial program (MIPOP) into a mixed-integer quadratically-constrained program (MIQCP), in the light of …
We present an integrated methodology for optimal short-term planning of integrated refinery- petrochemical complexes (IRPCs) and demonstrate it on a full-scale industrial case study …