Question $2$

As a logistics manager, you are responsible for coordinating the transportation of goods from three warehouses in cities $1,2,$ and $3.$ The warehouses have stock quantities of $30,40,$ and $50($tons$),$ respectively. The goods need to be transported to supermarkets in cities $4,5,$ and $6,$ which require $25,50,$ and $30$ tons of goods, respectively. Due to the nature of the goods, the smallest unit of the goods is $1$ ton, i$.$e$.,$ the amount that can be transported is an integer $($unit: ton$).$ The transportation costs $($in $1000$HKD$)$ per ton from each warehouse to each supermarket are provided in the table below. Formulate the problem as an integer linear program.

$\backslash$table$[[,$City $4,$City $5,$City $6],[$City $1,6,19,12],[$City $2,15,10,44],[$City $3,22,34,13]]$

Hi there, i need help on this minimum cost flow problem, thanks.