In my Computer Science class we've been exploring the Simplex Method and the applications it has with discovering optimal solutions. I've loved the challenge how much easier it makes finding solutions to business-model problems.
One problem that I have though is understanding how constraints are set when you have non-matching units. For example, an assignment we completed dealt with finding the maximum profit of a precious-metal processing setup. Most constraints made sense as their units lined up (water used per material, hours of labor per material, hours of refining, etc.) but there were two I could not understand on how to implement. We had a limit of rock in tons and could extract only one type of ore per ton. Each ton contained 10 oz copper, 2 oz gold, 3 oz silver, and 1 oz platinum. We're limited to a max of 2000 tons of rock to use.
I correctly constructed the problem up to this point (note that each variable is represents an ounce):
Maximize z = 10.20c + 422.30g + 6.91s + 853.00p subject to
30c + 15g + 19s + 12p ≤ 1000 (kW hours)
1000c + 6000g + 4100s + 9100p ≤ 1000000 (gal. water)
50c + 20g + 21s + 10p ≤ 640 (labor hours)
4c + 6g + 19s + 30p ≤ 432 (processing hours)
What I could not figure out was how to properly implement the maximum amount of ore and rock. I can't just put
10c + 2g + 3s + p ≤ 2000because it's mixing the ounce limit of each ore per ton with the constraint of maximum tons available. I tried using
c + g + s + p ≤ 2000to indicate how many tons we use and which ores are chosen but they would/will not explain why this is wrong.
What's the proper way of identifying and defining these as constraints so that they can be added?