Convex Quadratic Programming

Simple item page
dc.contributor.advisorGuta, Birhanu (PhD)
dc.contributor.authorSetargie, Abebe
dc.date.accessioned2018-07-11T06:58:45Z
dc.date.accessioned2023-11-04T12:31:14Z
dc.date.available2018-07-11T06:58:45Z
dc.date.available2023-11-04T12:31:14Z
dc.date.issued2016-08
dc.description.abstractQuadratic programming is one of the types of . There is no single method available for solving quadratic programming problem. So a number of methods have been developed for solving quadratic programming problems. In this paper we consider and method, method and . Method and penalty method are very important methods to solve equality, inequality and mixed constraint quadratic programming problemsen_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/7824
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectConvex Quadraticen_US
dc.titleConvex Quadratic Programmingen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Abebe Setargie.pdf
Size:
365.33 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download

Collections

Mathematics