Changing the combustion process of a gas turbine from a constant-pressure to a pressure-increasing approximate constant-volume combustion (aCVC) is one of the most promising ways to increase the efficiency of turbines in the future. In this paper, a newly proposed method to achieve such an aCVC is considered. The so-called shockless explosion combustion (SEC) uses auto-ignition and a fuel stratification to achieve a spatially homogeneous ignition. The homogeneity of the ignition can be adjusted by the mixing of fuel and air. A proper filling profile, however, also depends on changing parameters, such as temperature, that cannot be measured in detail due to the harsh conditions inside the combustion tube. Therefore, a closed-loop control is required to obtain an adequate injection profile and to reject such unknown disturbances. For this, an optimization problem is set up and a novel formulation of a discrete extremum seeking controller is presented. By approximating the cost function w... [more]

This work presents a methodology to represent logical decisions in differential algebraic equation simulation and constrained optimization problems using a set of continuous algebraic equations. The formulations may be used when state variables trigger a change in process dynamics, and introduces a pseudo-binary decision variable, which is continuous, but should only have valid solutions at values of either zero or one within a finite time horizon. This formulation enables dynamic optimization problems with logical disjunctions to be solved by simultaneous solution methods without using methods such as mixed integer programming. Several case studies are given to illustrate the value of this methodology including nonlinear model predictive control of a chemical reactor using a surge tank with overflow to buffer disturbances in feed flow rate. Although this work contains novel methodologies for solving dynamic algebraic equation (DAE) constrained problems where the system may experience... [more]

Artificial neural networks (ANNs) are used in various applications for data-driven black-box modeling and subsequent optimization. Herein, we present an efficient method for deterministic global optimization of ANN embedded optimization problems. The proposed method is based on relaxations of algorithms using McCormick relaxations in a reduced-space [\textit{SIOPT}, 20 (2009), pp. 573-601] including the convex and concave envelopes of the nonlinear activation function of ANNs. The optimization problem is solved using our in-house global deterministic solver MAiNGO. The performance of the proposed method is shown in four optimization examples: an illustrative function, a fermentation process, a compressor plant and a chemical process optimization. The results show that computational solution time is favorable compared to the global general-purpose optimization solver BARON.