LINEAR PROGRAMMING

3. Rizalmen Fashion Designer Sdn. Bhd. supplies clothes to three (3) boutique branches (Shah Alam, Bangi, and Kuala Lumpur) from its three (3) warehouses (A, B, and C). The transportation cost from each warehouse to boutique is given in Table 2. Warehouses A, B, and C produce 100, 180, and 150 clothes per month, respectively. Boutiques Shah Alam, Bangi, and Kuala Lumpur need to receive 175, 120, and 150 clothes per month, respectively. The distribution manager wants to determine the best plan for how many clothes to send from each warehouse to the respective boutiques each month. Table 2 Unit Cost (RM) From Shah Alam Bangi Kuala Lumpur A 50 10 70 B 60 40 60 C 30 20 50 a. Formulate a balanced transportation model that can be used to minimize the transportation cost. b. Use the Northwest-Corner Method to find a basic feasible solution (bfs) to the problem. C. Then, find its optimal solution by using the transportation simplex method. SHOW YOUR WORK and calculate the profit at each iteration. d. At the optimal solution, which boutique is not fully satisfied? State the quantity of the unmet demand