Interpret the components of mathematical equations that explain the linear programming problem for each of the following:
[A] The double-subscripted notation for the objective function for transportation costs (Town B): 3x11+ 2x12 + 7x13 + 6x14
[B] The double-subscripted notation for the supply constraint at Town B: x11 + x12 + x13 + x14 ≤ 5,000
[C] The inequality symbol in the supply constraint
[D] The double-subscripted notation for the demand constraint for Town C: x11 + x21 + x31 = 8,000
[E] The variable x in these equations
There is only town B and town C