Sausage and Cheese Ltd. prepares three gift packages containing sausages and cheeses. The "Tasters," "Succulent," and "Gourmet" gift packages contain 3 sausages and 6 cheeses, 5 sausages and 4 cheeses, and 6 sausages and 5 cheeses, respectively. There are 2500 sausages and 3000 cheeses available for packing, and demand is unlimited. Profits are $2.50, $3.50, and $4.00 for the "Tasters," "Succulent," and "Gourmet" gift packages, respectively. The goal is to maximize profits. Let T, S, and G represent the number of gift packages produced of type "Tasters," "Succulent," and "Gourmet," respectively. What is the objective function for this linear program?
A) Max T + S + G
B) Max 2.5T + 3.5S + 4G
C) Min T + S + G
D) Max 10(T + S + G)
E) Max 9T + 9S + 11G
Correct Answer:
Verified
Q19: What are the allowable constraint relationship types
Q20: How can the following Linear Program be
Q21: What is the optimal solution to the
Q22: Which of the following is not one
Q23: Capital Co. is considering which of five
Q25: How can the following Linear Program be
Q26: Which of the following statements is not
Q27: Riker Co. is considering which of four
Q28: Sausage and Cheese Ltd. prepares three gift
Q29: Capital Co. is considering which of five
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents