# How can I minimize this?

There is a drug that comes in two size. 1 is 300mg and cost 400 and 1 is 500mg and cost 600. Given a total dose needed, how many of each vile type do I need to minimize the cost.

Ex) I need a 1100mg dose, how many 300mg viles and how many 500 viles do I need to minimize the cost. I know the answer from looking at it is 2-300mg and 1-500mg.

So if x = # of 300mg viles and y = # of 500mg viles we have :

Total Cost = 400 * x + 600 * y; I also have the constraint that ( for this paticular example) 300x + 500y >= 1100mg.

I feel like this should be easy but my mind is not working.

Thanks

-Marc

HallsofIvy
Homework Helper
Better to write 300x+ 500y= 1100. Then if x and y are not integers, choose the next larger integer.

Solve 300x+ 500y= 1100 for y, say, as a function of x. Replace y in the cost equation by that. That will result in a quadratic function of x which you can minimize by completeing the square.

In some cases (but not in this one), the conversion from discrete to continuous isn't so forgiving. If this were one such case, you might do better to just write a program to check all possibilities and keep the largest. i.e.

Code:
for every point (x,y) in the domain
do see if this yields the best solution so far
if so, save this.
the optimum is the best solution so far.

For the record, you should usually use HallsOfIvy's method, except for trick problems designed to mess with your head.