IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v100y1999i1d10.1023_a1021708729556.html
   My bibliography  Save this article

Numerical Computation of Optimal Feed Rates for a Fed-Batch Fermentation Model

Author

Listed:
  • H. J. Oberle

    (University of Hamburg)

  • B. Sothmann

    (University of Hamburg)

Abstract

In this paper, we consider a model for a fed-batch fermentation process which describes the biosynthesis of penicillin. First, we solve the problem numerically by using a direct shooting method. By discretization of the control variable, we transform the basic optimal control problem to a finite-dimensional nonlinear programming problem, which is solved numerically by a standard SQP method. Contrary to earlier investigations (Luus, 1993), we consider the problem as a free final time problem, thus obtaining an improved value of the penicillin output. The results indicate that the assumption of a continuous control which underlies the discretization scheme seems not to be valid. In a second step, we apply classical optimal control theory to the fed-batch fermentation problem. We derive a boundary-value problem (BVP) with switching conditions, which can be solved numerically by multiple shooting techniques. It turns out that this BVP is sensitive, which is due to the rigid behavior of the specific growth rate functions. By relaxation of the characteristic parameters, we obtain a simpler BVP, which can be solved by using the predicted control structure (Lim et al., 1986). Now, by path continuation methods, the parameters are changed up to the original values. Thus, we obtain a solution which satisfies all first-order and second-order necessary conditions of optimal control theory. The solution is similar to the one obtained by direct methods, but in addition it contains certain very small bang-bang subarcs of the control. Earlier results on the maximal output of penicillin are improved.

Suggested Citation

  • H. J. Oberle & B. Sothmann, 1999. "Numerical Computation of Optimal Feed Rates for a Fed-Batch Fermentation Model," Journal of Optimization Theory and Applications, Springer, vol. 100(1), pages 1-13, January.
  • Handle: RePEc:spr:joptap:v:100:y:1999:i:1:d:10.1023_a:1021708729556
    DOI: 10.1023/A:1021708729556
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021708729556
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1021708729556?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eugene Khmelnitsky, 2002. "A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 312-325, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:100:y:1999:i:1:d:10.1023_a:1021708729556. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.