You run a small grocery store and have the following fruits in storage: 1000 apples, 1500 oranges, 75 watermelons, 100 peaches, and 125 mangos. You plan to package these fruits into gift sets and sell them during the New Year's Sale. The gift sets will be offered in 3 options. Each option is sold at a different price and subject to the following requirements in terms of the fruits that are in the bag: . Option A-Must contain 6 apples, 6 oranges, and 1 watermelon. Option B-Must contain 2 apples, 4 oranges, 1 peach, and 2 mangos. Option C-Must contain 1 watermelon, 1 peach, and 1 mango. Option A will sell for $100, option B will sell for $130, and option C will sell for $200. Assume that there is no limit on demand and that we allow fractional gift sets for simplicity. Your goal is to maximize revenue. Suppose we would like to formulate this as a LP problem, and have the following decision variables: TA =# of gift set A, B =# of gift set B, xc=# of gift set C a)What is our objective function? A. max 100xA +130xB + 200xc B. min 1000 (xA+xB) + 1500 (xA+xB) +75 (xA+xc) + 100 (xB+xc) +125 (*xB + xc) C. min 100xA+130xB +200xC D. max 1000 (xA+xB) + 1500 (xA+xB) +75 (xA+ xC) +100 (xB+xC) +125 (xB + xC) b)Which constraint ensures that we do not use more apples than we have in storage when we prepare the gifts sets? A. 6xA+2xB ≤ 1000 B. 6xA+4xB < 1000 C. xA+xB ≤ 1000 D. xA ≤ 6, xB ≤ 2 c) Create a spreadsheet model to solve this LP problem. What is the optimal value of xC? d)What is the optimal total number of gift sets to be packed? e)What is the optimal objective function value
Answer Questions a to e, based on the following information You run a small grocery store and have the following fruits in storage: 1000 apples, 1500 oranges, 75 watermelons, 100 peaches, and 125 mangos. You plan to package these fruits into gift sets and sell them during the New Year's Sale. The gift sets will be offered in 3 options. Each option is sold at a different price and subject to the following requirements in terms of the fruits that are in the bag: . Option A-Must contain 6 apples, 6 oranges, and 1 watermelon. Option B-Must contain 2 apples, 4 oranges, 1 peach, and 2 mangos. Option C-Must contain 1 watermelon, 1 peach, and 1 mango. Option A will sell for $100, option B will sell for $130, and option C will sell for $200. Assume that there is no limit on demand and that we allow fractional gift sets for simplicity. Your goal is to maximize revenue. Suppose we would like to formulate this as a LP problem, and have the following decision variables: TA =# of gift set A, B =# of gift set B, xc=# of gift set C a)What is our objective function? A. max 100xA +130xB + 200xc B. min 1000 (xA+xB) + 1500 (xA+xB) +75 (xA+xc) + 100 (xB+xc) +125 (*xB + xc) C. min 100xA+130xB +200xC D. max 1000 (xA+xB) + 1500 (xA+xB) +75 (xA+ xC) +100 (xB+xC) +125 (xB + xC) b)Which constraint ensures that we do not use more apples than we have in storage when we prepare the gifts sets? A. 6xA+2xB ≤ 1000 B. 6xA+4xB < 1000 C. xA+xB ≤ 1000 D. xA ≤ 6, xB ≤ 2 c) Create a spreadsheet model to solve this LP problem. What is the optimal value of xC? d)What is the optimal total number of gift sets to be packed? e)What is the optimal objective function value? (Only input the numerical value, NO need to include the "$" sign!) -
there is no inequalities, this is a data driven business modelling question
Step by step
Solved in 8 steps with 8 images
