The Coffee Bean Cafe offers 2 flavors of coffee, Classic Vanilla and Hazelnut Cream. The cafe...

Transcribed Image Text:

The Coffee Bean Cafe offers 2 flavors of coffee, Classic Vanilla and Hazelnut Cream. The cafe requires coffee grounds and creamer to make the coffees. The cafe receives six bags of coffee grounds weekly which equals to 420 tablespoons of coffee grounds, and six bottles of creamer which equal to 672 tablespoons of creamer. There is a demand for 10 pots of Classic Vanilla coffee weekly. 15 tablespoons of coffee grounds and 24 tablespoons of creamer are required for a pot of Classic Vanilla coffee. 20 tablespoons of coffee grounds and 32 tablespoons of creamer are required for a pot of Hazelnut Cream coffee. A pot of Classic Vanilla has a profit of $24, and a pot of Hazelnut Cream has a profit of $40. Determine the number of pots for each coffee flavor to make weekly so that profit can be maximized. -linear programming model formulation & use graphical analysis to find optimal solution Maximize Z = 24x1 + 40x2 Subject to: 15x120x2420 24x1 + 32x2672 x1 10 x1,x2 0 Linear Programming Results Coffee Bean Cafe-Crystal Solution RHS Dual X1 X2 Maximize 24 20 Constraint 1 15 20 The Coffee Bean Cafe offers 2 flavors of coffee, Classic Vanilla and Hazelnut Cream. The cafe requires coffee grounds and creamer to make the coffees. The cafe receives six bags of coffee grounds weekly which equals to 420 tablespoons of coffee grounds, and six bottles of creamer which equal to 672 tablespoons of creamer. There is a demand for 10 pots of Classic Vanilla coffee weekly. 15 tablespoons of coffee grounds and 24 tablespoons of creamer are required for a pot of Classic Vanilla coffee. 20 tablespoons of coffee grounds and 32 tablespoons of creamer are required for a pot of Hazelnut Cream coffee. A pot of Classic Vanilla has a profit of $24, and a pot of Hazelnut Cream has a profit of $40. Determine the number of pots for each coffee flavor to make weekly so that profit can be maximized. -linear programming model formulation & use graphical analysis to find optimal solution Maximize Z = 24x1 + 40x2 Subject to: 15x120x2420 24x1 + 32x2672 x1 10 x1,x2 0 Linear Programming Results Coffee Bean Cafe-Crystal Solution RHS Dual X1 X2 Maximize 24 20 Constraint 1 15 20