(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.
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Other |
| Lingua: | inglese |
| Pubblicazione: |
The Institute of National Planning
2018
|
| Soggetti: | |
| Accesso online: | http://repository.inp.edu.eg/handle/123456789/4095 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Lascia un commento!