Sally makes tea by blending two kinds of tea leaves. The cost per pound and the available pounds of each type of tea leaf:

Leaf	Taste rating	Aroma rating
Type 1	75	70
Type 2	90	80

Assume that aroma and taste attributes will be a weighted average of the attributes of the tea leaves (types) used in a blend. Assume the following:

a) A 1000 pounds of blended tea is to be produced using the minimum quality

for taste and aroma.

b) X1 = pounds of type 1 tea used in the blend

c) X2 = pounds of type 2 tea used in the blend

Formulate a linear programming problem to identify the lbs of Type 1 and Type 2 teas to be blended, in order to minimize total cost of the blend, while meeting quality standards and any other problem constraints. The above problem was also solved with some Linear Programming solver and a portion of the constraint set (along with optimal solution values in bold) is shown (the dual variables are also in blue to the right of the constraints):

Constraint 4	1	0	<=	750	0
Constraint 5	0	1	<=	550	0
Solution	500	500		3500