Development of N-Period Dynamic Programming Model for Determining EOQ under Stochastic Demand release_zp7e62gxbzckfgo6a54oo7cogy

by Aisha Sheikh Hassan

Published in Applied mathematics and computational intelligence by Penerbit Universiti Malaysia Perlis.

2024   Volume 13, Issue 2, p25-42

Abstract

This paper demonstrates an approach to determine the EOQ of an item under a periodic review inventory system with stochastic demand. Using N-Period dynamic programming planning horizon, we analyse the ordering policy during each period considering when demand is favorable or unfavorable to determine the EOQ and the associated profit at the end of each planning horizon. The objective is to determine in each period of the planning horizon, an optimal EOQ so that at the long run profits are maximized for a given state of demand. We also generate a formula to determine the number of matrix transitions for each planning horizon until final stage and then prove the formula by the principle of mathematical induction.
In application/xml+jats format

Archived Content

There are no accessible files associated with this release. You could check other releases for this work for an accessible version.

Not Preserved
Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type  article-journal
Stage   published
Date   2024-06-04
Container Metadata
Open Access Publication
Not in DOAJ
In ISSN ROAD
Not in Keepers Registry
ISSN-L:  2289-1315
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e1be764d-74d1-44dd-be03-aab4329b6944
API URL: JSON