抄録
In the process industry, the closed-loop real-time optimization technology has become widespread with several commercial packages. However, the current technology mainly focuses on snapshot optimization, and it may not be used effectively in a time-variant process such as a reactor with catalyst degradation and a boiler with fouling growth. Ideally it is required to consider multi-period optimization that can handle future constraints and the total run-time cost on the process. The main difficulty in treating a multi-period process optimization problem resides in heavy computation due to the size of the problem. This paper proposes an efficient SQP algorithm that decomposes a QP subproblem into individual single-period QP problems by exploiting the particular structure of the multi-period optimization problem. Our numerical experiments indicate that the proposed SQP decomposition algorithm may be advantageous for problems with long time horizon.
