Problem 3. (40 POINTS) FORMULATE THE MATHEMATHICAL LINEAR PROGRAMMING Decision Variables S: Supply (1,2), the supply of S1 is Y, and the supply of S2 is W, S3 is Z. T: Transshipment (1,2,3,4) R: Retail (1,2,3,4) the demand for Rl is P1, R2 is P2, R3 is P3, R4 is P4, R5 is P5, R6 is P6. TABLE: COST OF SENDING ITEMS FROM S TOT T1 T2 T3 T4 S1 1 1 1 1 S2 1 1 1 1 $3 1 1 1 1 TABLE: COST OF SENDING ITEMS FROM T TO R Rl R2 R3 R4 R5 R6 T1 1 1 1 1 1 1 T2 1 1 1 1 1 1 T3 1 1 1 1 1 1 T4 1 1 1 1 1 1 51 52 T1 E R1 R2 R3 R4 R5 R6 53 T4