a) Given a “balanced” transportation problem, wherein source = supply. You are in charge of a large construction project that involves two sites. Currently, you need 50 tons of aggregate at site 1 and 22 tons of aggregate at site 2. Two suppliers are available. Supplier A can deliver 29 tons and supplier B can deliver 43 tons. Restrictions on the type of work to be done require that at least 20 tons used at site 1 have to come from source B and no more than 10 tons of aggregate from source A can be used at site 2. Delivered aggregate costs ($/ton) are as follows:
|
To Site1 |
To Site 2 |
|
|
From Source A |
1 |
2 |
|
From Source B |
1.5 |
1.25 |
Required: Solve this as a linear programming problem to minimize the cost of aggregate.
Program won’t run? What did I warn you about over constraining the problem?