Michael Bynum

Discrete Math & Optimization

Discrete Math & Optimization

mlbynum@sandia.gov

(505) 844-2867

Biography

Michael Bynum is a Senior R&D Member of Technical Staff in the Discrete Math & Optimization Department at Sandia National Laboratories. His main area of expertise is computational optimization with emphasis in parallel algorithms and mixed-integer nonlinear programming.

Education

Michael has a B.S. from Texas A&M University (2013) and Ph.D. from Purdue University (2019), both in Chemical Engineering.

Selected Publications

  1. Bynum, Michael L., Gabriel A. Hackebeil, William E. Hart, Carl D. Laird, Bethany L. Nicholson, John D. Siirola, Jean-Paul Watson, and David L. Woodruff. Pyomo-optimization modeling in python. Vol. 67. Berlin/Heidelberg, Germany: Springer, 2021. https://github.com/Pyomo/pyomo/
  2. Klise, Katherine A., Michael Bynum, Dylan Moriarty, and Regan Murray. “A software framework for assessing the resilience of drinking water systems to disasters with an example earthquake case study.” Environmental modelling & software 95 (2017): 420-431. https://github.com/USEPA/WNTR/
  3. Bynum, Michael, Anya Castillo, Jean-Paul Watson, and Carl D. Laird. “Tightening McCormick relaxations toward global solution of the ACOPF problem.” IEEE Transactions on Power Systems 34, no. 1 (2018): 814-817.
  4. Rodriguez, Jose S., Robert B. Parker, Carl D. Laird, Bethany L. Nicholson, John D. Siirola, and Michael L. Bynum. “Scalable parallel nonlinear optimization with PyNumero and Parapint.” INFORMS Journal on Computing 35, no. 2 (2023): 509-517. https://github.com/sandialabs/parapint
  5. Ammari, Bashar L., Emma S. Johnson, Georgia Stinchfield, Taehun Kim, Michael Bynum, William E. Hart, Joshua Pulsipher, and Carl D. Laird. “Linear model decision trees as surrogates in optimization of engineering applications.” Computers & Chemical Engineering 178 (2023): 108347.
  6. Bynum, Michael L., Anya Castillo, Bernard Knueven, Carl D. Laird, Jean-Paul Watson, and John D. Siirola. “Decomposing Optimization-Based Bounds Tightening Problems Via Graph Partitioning.” Optimization Online (2021).

Software

Pyomo