2 items are filed under this topic.








Linear programming using the Simplex Method 
20091228 

From William: A gold processor has two sources of gold ore, source A and source B. In order to keep his plant running,
at least three tons of ore must be processed each day. Ore from source A costs $20 per ton to
process, and ore from source B costs $10 per ton to process. Costs must be kept to less than $80 per day.
Moreover, Federal Regulations require that the amount of ore from source B cannot exceed twice the
amount of ore from source A. If ore from source A yields 2 oz. of gold per ton, and ore from source B
yields 3 oz. of gold per ton, how many tons of ore from both sources must be processed each day to
maximize the amount of gold extracted subject to the above constraints?
I need a linear programming solution or algorithm of the simplex method solution.
Not a graphical solution. Thanks. Answered by Janice Cotcher. 





Operations Research 
19981008 

From Lisa Barrett: What is the history of operations research and the study of linear programming? Answered by Judi McDonald. 


