Problem: A drapery retailer stocks and sells six basic styles of draperies, each of which can be obtained from four different suppliers. The per yard profit she can realize on each of the styles, given the supplier, is depicted in the following table: 4 Style A B D ? 1.50 2.00 1.25 1.70 1.80 1.95 1.40 1.40 2.00 2.05 1.50 1.60 1.75 1.10 1.10 1.70 1 2 3 4 Supplier E 2.00 1.50 2.10 2.20 F 1.70 2.00 2.10 1.50 The retailer can purchase from suppliers 1, 2, 3, and 4 amounts of 375, 350, 400, 270 yards, respectively. She can sell 70, 80, 55, 90, 110, and 50 yards, respectively, of styles A, B, C, D, E, and F. Given the above information, formulate a mathematical program to determine the purchasing scheduling that will result in the highest profit.