The diagram below represents a transshipment problem. Node A and B represent your manufacturing factories. Node C$,$ D$,$ and E represent your warehouses. Node F$,$ G$,$ and H represent your retail centers. Your supply for Nodes A and B are $500$ and $650,$ respectively. The demand for Nodes F$,$ G$,$ and H are $400,325,$ and $425,$ respectively. All decision variables should use the following format, AC$,$ which represents the movement of product from Node A to Node C$.$ Formulate a linear program where your goal is to minimize costs. The costs to move from one node to another are located above each line.

Using the information above, how you write the constraint for Node B$?$

The diagram below represents a transshipment problem. Node A and B represent your manufacturing factories. Node C$,$ D$,$ and E represent your warehouses. Node F$,$ G$,$ and H represent your retail centers. Your supply for Nodes A and B are $500$ and $650,$ respectively. The demand for Nodes F$,$ G$,$ and H are $400,325,$ and $425,$ respectively. All decision variables should use the following format, AC$,$ which represents the movement of product from Node A to Node C$.$ Formulate a linear program where your goal is to minimize costs. The costs to move from one node to another are located above each line.

Using the information above, how you write the constraint for Node B$?$

$5$BC $+4$BD $+10$BE $<=650$

$5$BC $+4$BD $+10$BE $=650$

BC $+$ BD $+$ BE $<=650$

BC $+$ BD $+$ BE $$ DE $=0$