|
I could give you the answer right here and now, but i won't. Its really not very hard, and you do need to think about it.
If its not a homework question, then apologies.
For the others who might be reading, and wondering, you first need the objective function, which in this case, is an equation that describes the total amount of money to be made. This objective function will contain the variables C, and B.
Then there are the constraints, each of whom are equalities or inequalities containing the variables C and B.
The co-efficients in all cases for any of the variables can be any non-negative number, including zero. (you can make zero cookies but you cannot make negative numbers of cookies).
From the question, I am assuming that all the cookies that are baked will be sold. (or we could end up with the very interesting newsboy problem, and even more fun with 2-stage stochastic programming.... )
Speaking of assumptions, do cookies HAVE to be made in dozens? or can they be made in individual cookies? Are individual cookies divisible? If they are not, then we have a much harder integer programming question. Though i kind of suspect the answer you get from linear programming will turn out to be a nice integer number.
|