Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
Post a reply
Topic review (newest first)
Okay, and thanks for stopping by.
Thanks...I'm happy with the code. Runs in the blink of an eye, too.
Ahhhhhh! Nice neat code by the way.
FWIW = For what it's worth.
Hi Bobby and scientia,
This is a linear optimization problem, sometimes called linear programming.
Suppose the order is for of Platter A and of Platter B. Then we have:
We want to minimize subject to the above constraints. Let us then rewrite the above inequalities in terms of and one of and , say .
The 1st and 2nd inequalities give , the 1st and 3rd inequalities give , and the 2nd and 3rd inequalities give . The minimum appears to be 855 – however would imply , which does not satisfy the 2nd inequality. So we must instead have . Thus the minimum cost is $870 dollars for 10 of Platter A and 60 of Platter B.
The Phony Bologna Meat Company offers two platters. Platter A comes with 4 hamburgers, 3 hot dogs, and 2 pig's feet, and costs $15. Platter B comes with 3 hamburgers, 4 hot dogs, and 5 pig's feet, and costs $12.