GATE 2018 ME Set 1 · Question 26
The time series forecasting method that gives equal weightage to each of the most recent observations is
- A
Moving average method
- B
Exponential smoothing with linear trend
- C
Triple Exponential smoothing
- D
Kalman Filter
GATE 2018 · Mechanical Engineering · Set 1 · IIT Guwahati · printed as Q.16 in the ME section
Answer
From the official answer key published by IIT Guwahati.
Worked solution
In the simple -period moving average method, the forecast for time period is calculated as the arithmetic mean of the most recent observed demands:
Each of the most recent observations receives an identical weight of , while all older historical data receive a weight of zero.
In contrast, exponential smoothing methods (simple, Holt's linear trend, and Winters' triple) allocate exponentially declining weights to progressively older observations. A Kalman filter uses dynamic recursive Bayesian estimation with time-varying gain matrices rather than equal weighting.
Answer: (A) Moving average method
Practise Forecasting Models
15 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.
More from Forecasting Models
- GATE 2016 ME Set 3 · Q64The demand for a two-wheeler was 900 units and 1030 units in April 2015 and May 2015, respectively. The…
- GATE 2015 ME Set 1 · Q44For a canteen, the actual demand for disposable cups was 500 units in January and 600 units in February. The…
- GATE 2015 ME Set 2 · Q35Sales data of a product is given in the following table: | Month | January | February | March | April | May…
- GATE 2015 ME Set 2 · Q65A manufacturer has the following data regarding a product: Fixed cost per month = Rs. 50000 Variable cost…
- GATE 2014 ME Set 1 · Q29In exponential smoothening method, which one of the following is true?
- GATE 2014 ME Set 2 · Q29A component can be produced by any of the four processes I, II, III and IV. The fixed cost and the variable…
Question from the official GATE 2018 ME paper (Set 1), IIT Guwahati. Solutions by PARIXO AI. All 65 questions of this paper.