Scott P. Kolodziej

Learn More
In this paper, we present the derivation of the multiparametric disaggregation technique by Teles et. al (2001) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive programming and exact linearizations, and incorporated into two global optimization(More)
In this paper, we introduce a generalized multiperiod scheduling version of the pooling problem to represent time varying blending systems. A general nonconvex MINLP formulation of the problem is presented. The primary difficulties in solving this optimization problem are the presence of bilinear terms, as well as binary decision variables required to(More)
  • 1