Data‐driven coordination of subproblems in enterprise‐wide optimization under organizational considerations

Abstract

AbstractWhile decomposition techniques in mathematical programming are usually designed for numerical efficiency, coordination problems within enterprise‐wide optimization are often limited by organizational rather than numerical considerations. We propose a “data‐driven” coordination framework which manages to recover the same optimum as the equivalent centralized formulation while allowing coordinating agents to retain autonomy, privacy, and flexibility over their own objectives, constraints, and variables. This approach updates the coordinated, or shared, variables based on derivative‐free optimization (DFO) using only coordinated variables to agent‐level optimal subproblem evaluation “data.” We compare the performance of our framework using different DFO solvers (CUATRO, Py‐BOBYQA, DIRECT‐L, GPyOpt) against conventional distributed optimization (ADMM) on three case studies: collaborative learning, facility location, and multiobjective blending. We show that in low‐dimensional and nonconvex subproblems, the exploration‐exploitation trade‐offs of DFO solvers can be leveraged to converge faster and to a better solution than in distributed optimization.