Optimal control of the penicillin G fed-batch fermentation: An ...

PENICILLIN G FED-BATCH FERMENTATION 25Step 6. Repeat Steps 1-5 with a new guess of SO in order to minimize J[u, XO].For the performance measure under consideration, equation (8), it can be easily shown (byusing (14) and (16)) that the stopping condition for this case is dP/dt(tr)=O, as could beexpected. In the case of a constraint on the control u and/or the state vector x, only someminor modifications are required, the algorithm itself remaining a two-dimensional search. Adetailed analysis of this algorithm in comparison with the algorithm proposed by Lim et al. l5together with a verification of all necessary conditions for optimality can be found inReference 4. The main difference from the algorithm of Lim et al. is that we do not make useof the costate variables, whatever the performance index under consideration.3.2. Simulation resultsWe now present some results obtained with the above computational algorithm. Weconcentrate on two specific values of the parameter B (i) B = lo-" as an approximation ofthe original Blackman-type kinetics (3) and (ii) the other extremal value B = krit = lo-', where~ ( p reduces ) to the Monod-type law (13).3.2.1. B = 10-". In the left plot of Figure 4 we have visualized the actions taken by theFor every SO the optimal switch time t2 has beencomputational algorithm for B= lo-''.calculated. As a consequence, we obtain the corresponding values for P(tr) and tr. Clearly, theoptimal couple (&*, t;) is the one which maximizes P(tr). Observe the quadratic behaviour ofP(tr) as a function of SO, so that there exists a unique optimal solution to this problem.Observe that there exists a lower limit Smin on the possible values for SO, corresponding totz = 0. In that case the complete initial state xo is on the singular hyperplane, so singularcontrol starts immediately. Note that SO = a corresponds to a complete batch fermentation:tr = t3 = tz, with u(t) = 0 for ali t. Even for values of SO in the neighbourhood of a, thecondition dP/dt = 0 is never met before t = t2. As a result, we can indeed apply the proposedcomputational algorithm to the whole possible range SO E [Smin, a]. A derived benefit is ofcourse that a good starting value for SO is not required for the algorithm to converge. Somenumerical values for the optimal control are summarized in Table 11. The right plot of Figure 4100 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2s(w Id1.LO+Figure 4. B= lo-". Left plot: extremal values for P(tf), t2 and tf as functions of SO. Scaling: tJSO, rf/500,(P(tr) - 8150)/180. Right plot. optimal glucose feed rate and corresponding cell, glucose, product, T- and p-profiles.Scaling: c, x 300, c, x 5, q103, p x 100, r x 2 x lo4, u/300Time [h]