In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered
In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered
此外，为达到极小化总订购成本及总持有成本，本模型利用混合整數规划技巧提供一个简单求解方法，可同时求得最佳订购次數、订购点及每次订购數量。