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

For any feasible solution to the problem, the objective function value is the total cost of shipping the product from the distribution centers to the warehouses.

A feasible solution to the ABC problem could include X_DM = 150

A feasible solution to the ABC problem could include X_JA = 70

There are feasible solutions where all constraints are binding.

Exactly two of the answers are correct.