Satisfaction of path chance constraints in dynamic optimization problems

•Proposed an algorithm to solve dynamic optimization problems with path chance constraints.•The algorithm returns a solution after a finite number of iterations.•The solution is guaranteed to satisfy the chance constraint.•The solution is a heuristically optimal point.•Optimized a bioreactor with ten uncertain parameters.