Your initials: Page 3 of 8 2. (30 points) A foreign-car dealer with warehouses in New York and Baltimore receives orders from dealers in Philadelphin and Trenton. The dealer in Philadelphia needs 22 cars and the dealer in Trenton needs 44. The New York warehouse has 33 cars and the Baltimore warehouse has 55. The cost of shipping cars from Baltimore to Philadelphia is $130 per car, from Baltimore to Trenton $90 per car, from New York to Philadelphia $100 per car, and from New York to Trenton $70 per car. Use Linear Programming, in 2 Variables only, and graphing method to find the number of cars to be shipped from each warehouse to each dealer to minimize the shipping cost. Let = number of cars shipped from Baltimore to Trenton, and y = number of cars shipped from Baltimore to Philadelphia. Use the above information to answer parts (a)-(e). (a) (8 points) Organize the information in a schematic diagram. Fully label your diagram. (b) (6 points) Formulate a complete linear programming problem. Your initials: Page 4 of 81 (c) (10 points) Sketch the feasible set. Show all the details. Fully label your graph. Find all the vertices of the feasible set. (d) (4 points) Use the Fundamental Theorem of Linear Programming to determine the optimal point. (e) (2 points) Interpret the result.