Formulate a linear program that will identify the optimal shipment strategy for your operation to keep your overall costs as low as possible.
a) Minimize: Σ(ci * xi) for i = 1 to n
b) Subject to: Σ(aij * xj) ≥ bi for i = 1 to m
c) Maximize: Σ(pi * xi) for i = 1 to n
d) Constraints: xi ≥ 0 for i = 1 to n