ON DECISION‐MAKING FOR MAXIMUM PROFIT PER UNIT OF TIME FROM BATCH PRODUCTION
研究了如何通过分数规划和动态规划的组合方法，找到使每批牲畜增重利润最大化的饲养序列，解决了此前仅靠枚举法难以处理的问题。
Finding ration sequences which result in maximum profit per day from fattening batches of livestock over successive weight intervals has posed difficulties in earlier studies. Fractional and dynamic programming are considered as solution methods and illustrated for a problem previously solved by total enumeration. Other problems are discussed which would be best solved by a combination of the two methods. A novel proposal is made for using the two methods to maximise the present value of returns from sequencing weight gains over infinite production cycles.