Data on Cost, Demand, and Supply for a Balanced (Total $\mathrm{X}_{i j}$

Multiple Choice

Data on cost, demand, and supply for a balanced (total supply equals total demand) transportation problem is given in the table below. In the linear programming formulation of this transportation problem with $\mathrm{X}_{i j}$ denoting the amount shipped from supply point $i$ ( 1 or 2 ) to demand point $j(1,2$ or 3 ) , the correct objective function is

A) $\operatorname{Max}: 5 X_{11}+6 X_{12}+3 X_{13}+7 X_{21}+2 X_{22}+5 X_{23}$
B) $\operatorname{Min}: 5 X_{11}+6 X_{12}+3 X_{13}+7 X_{21}+2 X_{22}+5 X_{23}$
C) $\operatorname{Max}: X_{11}+X_{12}+X_{13}+X_{21}+X_{22}+X_{23}$
D) $\operatorname{Min}: X_{11}+X_{12}+X_{13}+X_{21}+X_{22}+X_{23}$