subject - Information operation research I

please read instruction

Page 4 of 13 3. (40 points) A computer chip manufacturer dus warehouses in Bangkok and Beijing with 20,000 chips and 30,000 chips, respectively. The manufacturer mest ship 5,000 chip to Little Rock, 20.000 chips to London, and 25.000 chips to Los Angeles. The table below gives the the travel time (in hours) between each warehouse and each customer Bangkok Customer Little Rock London Los Angeles 21.9 113 16.3 16 2 113 120 Formulate but do not solve a linear program that determine how many chips from each warehouse should ship to each customer to minimize the total travel time of the shipped chips. To save some time, you may refer to Bangkok and Beijing as wareboss 1 and 2. respectively, and Little Rock. London, and as Angeles as customers 1, 2 and 3. respectively. Points for this problem will generally be awarded based upon the following criterin: . Correctly formulated objective will exen 13 points, Correctly formulated constraints will earn 25 points Correct variable bounds will carn 2 points Incorrect formulation with terms with inconsistent units will low point for each Incorrect formulations with unclear varinble definitions will be point for each definition An bonest attempt at this problem will receive a minimum of 8 points *Travel times are from Google Map The instructor may devise from the point we appropriate