OPTIMAL-SOLUTIONS OF PROCESSES DESCRIBED BY SYSTEMS OF DIFFERENTIAL-ALGEBRAIC EQUATIONS

A new procedure for the determination of optimal solutions for process es described by differential-algebraic equations is presented in this paper. It is shown to overcome the usual drawbacks of the feasible-pat h methods and compare favourably with the recently developed unfeasibl e-path algorithms. Furthermore, it is shown to be algorithmically equi valent to eliminating the algebraic part of the system by variable sub stitution, when the algebraic equations can be solved analytically and no inequality constraint is present. A numerical example is provided for illustration purposes.