Abstract

In this paper two mathematical models of multistage inventory control processes with continuous and discrete density functions of demands are investigated. These processes are modelled by recursion equations of the dynamic programming. For inventory control problem with the continuous density function there was created a new continuous optimal control problem, which is equivalent to the given one. Applying the maximum principle solves this new problem. The optimal policy ordering policy is defined. Also, we have found the optimal policy for ordering of products in the multistage inventory control problem with the discrete density function of demands. In this case such number of moments of time was found that the demands are satisfied without extra products.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.