Answer: 153
Step-by-step explanation:
When we have a group of N elements, the total number of combinations of K elements ( K ≤ N) is:
Where N! = N*(N - 1)*(N - 2)*...*2*1
In this case, we have a group of 18 people (then N = 18) and we want to see how many different combinations of 2 we can make (K = 2).
Using the above equation we get:
There are 153 different ways in which the manager can do this.
Answer:
Step-by-step explanation:
Let and
be the production level of milk and white chocolate-covered strawberries respectively. According to the given data, we know the total profit will be
The restrictions can be written as
All the restrictions can be plotted in the same graph to find the feasible region where all of them are met. The graph is shown in the image below
The optimal solution will be the level of production such that
* All restrictions are met
* The total profit is maximum
The optimal level of production can be found in (at least) one of the vertices of the feasible region. We'll try each one as follows
P(0,0)=0
P(400,200)=$2.25 (400)+$2.50 (200) = $1400
P(600,200)=$2.25 (600)+$2.50 (200) = $1850
P(800,0)=$2.25 (800)+$2.50 (0) = $1800
We must produce 600 milk chocolate-covered strawberries and 200 white chocolate-covered strawberries to have a maximum profit of $1850/month
