19 citations · 64 across the 17 of their papers we have counts for
5 papers · 1 filter
Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm
Zedong Peng, Albert Lee, David E. Bernal Neira
Dynamic optimization problems involving discrete decisions have several applications, yet lead to challenging optimization problems that must be addressed efficiently. Combining di…
A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP
Zedong Peng, Kaiyu Cao, Kevin C. Furman +3
The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating c…
Measure This, Not That: Optimizing the Cost and Model-Based Information Content of Measurements
Jialu Wang, Zedong Peng, Ryan Hughes +3
Model-based design of experiments (MBDoE) is a powerful framework for selecting and calibrating science-based mathematical models from data. This work extends popular MBDoE workflo…
Logic-Based Discrete-Steepest Descent: A Solution Method for Process Synthesis Generalized Disjunctive Programs
Daniel Ovalle, David A. Liñán, Albert Lee +4
The optimization of chemical processes is challenging due to the nonlinearities arising from process physics and discrete design decisions. In particular, optimal synthesis and des…
Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
David E. Bernal Neira, Ignacio E. Grossmann
We propose the formulation of convex Generalized Disjunctive Programming (GDP) problems using conic inequalities leading to conic GDP problems. We then show the reformulation of co…