Quadratic Programming Problem

Simple item page
dc.contributor.advisorGuta, Berhanu (PhD)
dc.contributor.authorDamtew, Tariku
dc.date.accessioned2021-04-17T21:41:04Z
dc.date.accessioned2023-11-04T12:31:15Z
dc.date.available2021-04-17T21:41:04Z
dc.date.available2023-11-04T12:31:15Z
dc.date.issued2020-01-20
dc.description.abstractQuadratic programming is one of the type of nonlinear optimization problems in which the objective function is quadratic and all the constraints are linear. There is no single method available for solving a quadratic programming problem. So a number of methods have been developed for solving quadratic programming problems. In this project concerns for convex and non convex quadratic programming problems with Lagrangian,Wolfe’s and Beale methods.en_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/26161
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectQuadraticen_US
dc.subjectProgrammingen_US
dc.subjectProblemen_US
dc.titleQuadratic Programming Problemen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Tariku Damtew 2020.pdf
Size:
284.47 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