A comparative analysis of some methods for solving quadratic programming problems

dc.contributor.author	Zaghloul, Fathia
dc.contributor.author	Zolfa, Shalabi
dc.date.accessioned	2018-08-13T12:39:18Z
dc.date.available	2018-08-13T12:39:18Z
dc.date.issued	1988-02
dc.identifier.uri	http://repository.inp.edu.eg/xmlui/handle/123456789/4095
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.publisher	The Institute of National Planning	en_US
dc.relation.ispartofseries	External notes;1450
dc.subject	Programming	en_US
dc.subject	Methodology	en_US
dc.subject	Nonlinear programming	en_US
dc.title	A comparative analysis of some methods for solving quadratic programming problems	en_US
dc.type	Other	en_US