Please use this identifier to cite or link to this item: http://dspace.iua.edu.sd/handle/123456789/3588
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSahar Abd Elgadir Alobeid Abd Alrahim-
dc.date.accessioned2018-07-16T08:52:44Z-
dc.date.available2018-07-16T08:52:44Z-
dc.date.issued2018-
dc.identifier.citationInternational University of Africa - Faculty of pure and applied science- Science in Mathematics - Department of Mathematicsen_US
dc.identifier.urihttp://dspace.iua.edu.sd/handle/123456789/3588-
dc.description.abstractIn this research, we discuss linear and nonlinear programming problems and methods. We have implemented the simplex and interior-point methods for linear programming problems. We also implement interior-point method for nonlinear programming problems. The convergence analysis and complexity of these methods are presented. Computational results that compare between the simplex method and the interior-point method are reported.en_US
dc.subjectMathematicsen_US
dc.titleThe implementation of interior-point method for solving nonlinear constrained optimization problemsen_US
Appears in Collections:أطروحات الماجستير

Files in This Item:
File Description SizeFormat 
intro.pdf246.44 kBAdobe PDFThumbnail
View/Open
reserch.pdf
  Restricted Access
1.38 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.