This is a FORTRAN model of the Tennessee Eastman process control challenge problem. The model consists of 50 equation and 50 variables. The sparsity pattern, shown on the right, has been automatically generated using DAEPACK.
Recent Publications
- Tighter Bounds on Transient Moments of Stochastic Chemical Systems
- Generalized derivatives of optimal-value functions with parameterized convex programs embedded
- Level sets of nonsmooth functions, part 1: Lipschitz and piecewise-differentiable rank theorems
- Optimization under uncertainty of a hybrid waste tire and natural gas feedstock flexible polygeneration system using a decomposition algorithm