A business dedicates to the import and sale of worn out coffee. The company concerns three types of coffee of select quality.: Colombian coffee, Honduran coffee and Dominican coffee. The company prepares three different mixtures in which it uses those three types of coffee. These mixtures are sold in bags of one pound. The three mixtures are:
|
Mix
|
Mix Composition
|
Price
|
|
Great Select
|
At least 35% of Colombian coffee and at least 25% of Honduran coffee
|
$8.75/lb
|
|
Select
|
At least 60% of Honduran coffee
|
7.25/lb
|
|
Regular
|
No more than 60% of Dominican coffee and at least 25% of Colombian coffee
|
6.25lb
|
The company counts with the amounts of coffee of each type that occur ahead, reason why has paid the prices indicated by pound:
|
Type of Coffee
|
Quantity Available
|
Cost/lb
|
|
Colombian
|
105 lb
|
3.25
|
|
Honduran
|
180 lb
|
3.00
|
|
Dominican
|
130lb
|
2.75
|
The company wishes to determine the amount of pounds that need to prepare of each one of the three mixtures to maximize its gain, under the assumption that he could sell the totality of each prepared mixture.
Formulates the model of lineal programming to solve that situation.