The fourth variation builds upon Part $3$ and adds two new constraints. First, we add a $150$ widget capacity constraint at the Atlanta DC specific to widget $1.$ In other words, the Atlanta DC can process at most $150$ units of widget $1.$ Second, we add a similar constraint for the the Boston DC specific to widget $2$: the Boston DC can now handle at most $200$ units of widget $2.$ What is the new minimum cost of the optimal solution?