Home /
Expert Answers /
Advanced Math /
a-company-sells-sets-of-kitchen-knives-a-basic-set-consists-of-2-utility-knives-and-1-chef-39-s-knif-pa592
(Solved): A company sells sets of kitchen knives. A Basic Set consists of 2 utility knives and 1 chef's knife ...
A company sells sets of kitchen knives. A Basic Set consists of 2 utility knives and 1 chef's knife. A Regular Set consists of 2 utility knives, 1 chef's knife, and 1 slicer. A Deluxe Set consists of 3 utility knives, 1 chefs knife, and 1 slicer. The profit is $40 on a B asic $ Set, $60 on a Regular Set, and $80 on a Deluxe Set. The factory has on hand 1600 utility knives, 800 chef's knives, and 400 slicers. (a) If all sets will be sold, how many of each type should be made up in order to maximize profit? What is the maximum profit? (b) A consultant for the company notes that more profit is made on a Regular Set than on a Basic Set, yet the result from part (a) recommends making up more Basic. Sets than Regular Sets. She is puzzled how this can be the best solution. How would you respond? (a) Find the objective function to be used to maximize profit. Let x1 be the number of Basic Sets, let x2 be the number of Regular Sets, and let x3 be the number of Deluxe Sets: What is the objective function? z=40x1+60x2+80x3 (Do not include the $ symbol in your answers.) (a) To maximize profit, the company should make up Basic Sets, Regular Sets, and Deluxe Sets. (Simplify your answers.)
a)Let x be the number of Basic Sets, y be the number of Regular Sets, and z be the number of Deluxe Sets. We are given that the following constraints must be satisfied: (utility knives) (chef's knives) (slicers)The profit is given by . We want to maximize this profit subject to the given constraints. This can be done using linear programming. The following is the corresponding linear programming problem: subject to: We can solve this problem using the simplex method. The following is the optimal solution:x = 1000
y = 0
z = 400The maximum profit is 40000.