AN ITERATIVE METHOD FOR FORECASTING MOST PROBABLE POINT OF STOCHASTIC DEMAND

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

BEHNAMIAN J.; FATEMI GHOMI S.M.T.; KARIMI B.; FADAEI MOLUDI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2014 | Volume:10 | Issue:2 Page(s): 1-9

Download Full-Text

View:

258

Download:

Cites:

Information Journal Paper

Title

AN ITERATIVE METHOD FOR FORECASTING MOST PROBABLE POINT OF STOCHASTIC DEMAND

Author(s)

BEHNAMIAN J. | FATEMI GHOMI S.M.T. | KARIMI B. | FADAEI MOLUDI M. | Issue Writer Certificate

Keywords

UNCERTAINTY

FIRST-ORDER TAYLOR SERIES EXPANSION

STATE SPACE MODELS

MOST PROBABLE POINT

FORECASTING PRACTICE

DEMAND FORECASTING

Abstract

The DEMAND FORECASTING is essential for all production and non-production systems. However, nowadays there are only few researches on this area. Most of researches somehow benefited from simulation in the conditions of demand UNCERTAINTY. But this paper presents an iterative method to find most probable stochastic demand point with normally distributed and independent variables of n-dimensional space and the demand space is a nonlinear function. So this point is compatible with both external conditions and historical data and it is the shortest distance from origin to the approximated demand-state surface. Another advantage of this paper is considering n-dimensional and nonlinear (nth degree) demand function. Numerical results proved this procedure is convergent and running time is reasonable.

Cites

No record.

References

Cite

APA: Copy

BEHNAMIAN, J., FATEMI GHOMI, S.M.T., KARIMI, B., & FADAEI MOLUDI, M.. (2014). AN ITERATIVE METHOD FOR FORECASTING MOST PROBABLE POINT OF STOCHASTIC DEMAND. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 10(2), 1-9. SID. https://sid.ir/paper/309971/en

Vancouver: Copy

BEHNAMIAN J., FATEMI GHOMI S.M.T., KARIMI B., FADAEI MOLUDI M.. AN ITERATIVE METHOD FOR FORECASTING MOST PROBABLE POINT OF STOCHASTIC DEMAND. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2014;10(2):1-9. Available from: https://sid.ir/paper/309971/en

IEEE: Copy

J. BEHNAMIAN, S.M.T. FATEMI GHOMI, B. KARIMI, and M. FADAEI MOLUDI, “AN ITERATIVE METHOD FOR FORECASTING MOST PROBABLE POINT OF STOCHASTIC DEMAND,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 10, no. 2, pp. 1–9, 2014, [Online]. Available: https://sid.ir/paper/309971/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops