(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.

Guardat en:
Dades bibliogràfiques
Autors principals: Zaghloul, Fathia, Zolfa, Shalabi
Format: Other
Idioma:anglès
Publicat: The Institute of National Planning 2018
Matèries:
Accés en línia:http://repository.inp.edu.eg/handle/123456789/4095
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!