(1450) A comparative analysis of some methods for solving quadratic programming problems تحليل مقارن لبعض طرق حل مسائل البرمجة التربيعية
The problem of quadratic programming is that of minimizing a convex function subject linear constraints. It is one of the simplest cases of nonlinear programming.
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Other |
| Hizkuntza: | ingelesa |
| Argitaratua: |
The Institute of National Planning
2018
|
| Gaiak: | |
| Sarrera elektronikoa: | http://repository.inp.edu.eg/handle/123456789/4095 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|