Optimization · 1992 · 101 citations · 9 references
EngineeringIndustrial EngineeringManufacturing EngineeringOperations ResearchOptimizationProduction EngineeringConvex OptimizationGlobal OptimizationMathematical ProgrammingOptimization TheoryProcess OptimizationProduction OptimizationIndustrial Process OptimizationLinear ModelsNonlinearity
Abstract In this paper we present an algorithm for the pooling problem in refinery optimization based on a bilinear programming approach. The pooling problem occurs frequently in process optimization problems, especially refinery planning models. The main difficulty is that pooling causes an inherent nonlinearity in the otherwise linear models. We shall define the problem by formulating an aggregate mathematical model of a refinery, comment on solution methods for pooling problems that have been presented in the literature, and develop a new method based on convex approximations of the bilinear terms. The method is illustrated on numerical examples Keywords: Pooling ProblemGlobal OptimizationBilinear Programming †This work was supported in part by The Royal Norwegian Council for Scientific and Industrial Research under contract number ST.10.12.221 109 †This work was supported in part by The Royal Norwegian Council for Scientific and Industrial Research under contract number ST.10.12.221 109 Notes †This work was supported in part by The Royal Norwegian Council for Scientific and Industrial Research under contract number ST.10.12.221 109
9
Generalized Benders decomposition
Arthur M. Geoffrion · Journal of Optimization Theory and Applications · 1972 · 2.5K citations
Jointly Constrained Biconvex Programming
Faiz Al‐Khayyal, James E. Falk · Mathematics of Operations Research · 1983 · 550 citations
Studies of the behavior of recursion for the pooling problem
C. A. Haverly · ACM SIGMAP Bulletin · 1978 · 199 citations · Full text
Successive Linear Programming at Exxon
Thomas E. Baker, Leon S. Lasdon · Management Science · 1985 · 119 citations