Unconstrained Quadratic Programming Problem with Uncertain Parameters
DOI:
https://doi.org/10.34257/GJREIVOL21IS1PG1Keywords:
quadratic programming, gradient approach, uncertain parameters, risk simulator, the system of linear equations
Abstract
In this paper, an unconstrained quadratic programming problem with uncertain parameters is discussed. For this purpose, the basic idea of optimizing the unconstrained quadratic programming problem is introduced. The solution method of solving linear equations could be applied to obtain the optimal solution for this kind of problem. Later, the theoretical work on the optimization of the unconstrained quadratic programming problem is presented. By this, the model parameters, which are unknown values, are considered. In this uncertain situation, it is assumed that these parameters are normally distributed; then, the simulation on these uncertain parameters are performed, so the quadratic programming problem without constraints could be solved iteratively by using the gradient-based optimization approach. For illustration, an example of this problem is studied. The computation procedure is expressed, and the result obtained shows the optimal solution in the uncertain environment. In conclusion, the unconstrained quadratic programming problem, which has uncertain parameters, could be solved successfully.
Downloads
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
How to Cite
Published
2021-01-15
Issue
Section
License
Copyright (c) 2021 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.