ABC Trucking has three distribution centers (DCs) located in Dallas, Jersey City, and Riverside that transport product each week to warehouses located in five cities: Seattle, Topeka, Minneapolis, Atlanta, and Boston. Each DC has an upper limit on the number of units of product that it can ship each week and each warehouse has a requirement for the volume of product that it can receive. These values and the per unit shipping costs for all DC-warehouse pairs are provided in the accompanying Excel workbook.

ABC seeks a feasible shipping plan that minimizes the total shipping cost.

Let X_IK be the amount shipped from DC, for I = D, J, R, to the warehouse K, for K = S, T, M, A, B. Note the letters correspond to the first letter of the cities above. For example, X_DS is the amount shipped from Dallas to Seattle.

Which of the following are true?

Group of answer choices

Minimize Z = X_DS + X_DT + X_DM + X_DA + X_DB + X_JS + X_JT + X_JM + X_JA + X_JB + X_RS + X_RT + X_RM + X_RA + X_RB is the objective function.

X_DS + X_JS + X_RS <= 50 would work as a constraint

X_RS + X_RT + X_RM + X_RA + X_RB >= 100 would work as a constraint.

X_DT + X_JT + X_RT >= 60 would work as a constraint.

Exactly two of the answers are correct.