论文信息 - Optimization for a recombinantE. coli fed-batch fermentation

Optimization for a recombinantE. coli fed-batch fermentation

The operating strategy that produces the maximum foreign protein expression for a fed-batch process is desired. This is achieved by using a feasible quadratic programming (FSQP) algorithm with a structured model that describes cell growth and product formation for recombinantE. coli. Optimization calculations for a fed-batch culture have not been performed with a model of this complexity up to this point. A constraint on the maximum cell concentration was included. For a fixed value of batch time, the results show that the optimal time profile of feed flow rate can increase the yield of foreign protein by 12–29% over a constant feed rate policy. Also, it was found that the computation time for the FSQP algorithm can be reduced significantly by considering suboptimal profiles of the feed rate, with a minor effect on calculated protein yield.

[1] J. E. Cuthrell,et al. On the optimization of differential-algebraic process systems , 1987 .

[2] H C Lim,et al. Feedback optimization of fed‐batch fermentation , 1987, Biotechnology and bioengineering.

[3] W. Bentley,et al. A novel structured kinetic modeling approach for the analysis of plasmid instability in recombinant bacterial cultures , 1989, Biotechnology and bioengineering.

[4] Rein Luus,et al. Optimization of non‐steady‐state operation of reactors , 1989 .

[5] W. Bentley,et al. Plasmid‐encoded protein: The principal factor in the “metabolic burden” associated with recombinant bacteria , 1990, Biotechnology and bioengineering.

[6] J. F. Bonnans,et al. Avoiding the Maratos effect by means of a nonmonotone line search II. Inequality constrained problems—feasible iterates , 1992 .

[7] W. Bentley,et al. Investigation of subpopulation heterogeneity and plasmid stability in recombinant escherichia coli via a simple segregated model , 1993, Biotechnology and bioengineering.

[8] A. Tits,et al. Nonmonotone line search for minimax problems , 1993 .

[9] André L. Tits,et al. On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..