A Novel Method of Solving a Quadratic Programming Problem Under Stochastic Conditions
The optimization problem calculates an accurate solution, and the result of inequality constraints results in an approximate solution. The new method is developed under stochastic conditions to give an optimal expected value for the linear programming problem of downscaling data generated through an autoregressive integrated moving average (ARIMA) model. In this chapter, we predict future values using the ARIMA model for specified optimization problems. Wolfe’s modified method is adopted to solve the linear programming problem under stochastic conditions.
- 1.M.S. Bazaraa, H.D. Sherali, C.N. Shetty, Nonlinear programming theory and algorithms, John Wiley and Sons, Third edition.45, 846 (1994)Google Scholar
- 2.K. Swarup, P.K. Gupta, M. Mohan, Operations Research, Sultan Chand&Sons.22, 69–72 (1978)Google Scholar
- 5.G.E. Thompson, Linear programming: An elementary introduction, Macmillan, New York, 1 May in ACM SIGMAP Bulletin New York, 26 (1973)Google Scholar
- 6.K. Mubiru, Optimal replenishment policies for two-Echelon inventory problems with stationary price and stochastic demand, International Journal of Innovation and Scientific Research 13(1), 98–106 (2015)Google Scholar
- 8.A.K. Dhaiban, A comparative study of stochastic quadratic programming and optimal control model in production - inventory system with stochastic demand 37, April (2017)Google Scholar