Topic: Module 7 Assignment: Linear Programming (Oct 9)

A company wants to minimize the cost of transporting its product from its warehouses (2) to its stores (3). If the load leaves store A, the cost of the unit transported to store C is $8, to store D is $6, and to store E is $3. If the load leaves store B, the cost of the unit transported to store C is $2, to store D is $4, and to store E is $9. Store C demands a minimum quantity of 40 units. Store D requires a minimum quantity of 35 units. The E-store requires a minimum quantity of 25 units. Warehouse A cannot store more than 70 units. Store B cannot store more than 40 units.

Using Linear Programming (Using RStudio) find the minimum cost, how many units are kept in warehouses A and B, the cost of bringing products to store E, and check for compliance with restrictions.