Interior point methods for nonlinear programming and application to mixed integer nonlinear programming
The main objectives of this thesis are (i) to develop primal-dual interior point algorithms for solving Nonlinear Programming (NLP) problems (ii) to develop a branch and cut algorithm for solving 0-1 Mixed Integer Nonlinear Programming (MINLP) problems and (iii) the application of the interior point...
Main Author: | |
---|---|
Published: |
Imperial College London
2011
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.506753 |