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: | Akrotirianakis, Ioannis |
---|---|
Published: |
Imperial College London
2011
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.506753 |
Similar Items
-
Identification of nonlinear interconnected systems
by: Pepona, Eleni
Published: (2009) -
Computational methods for large-scale quadratic programming
by: Morales-Perez, Jose Luis
Published: (1993) -
The modelling and analysis of mathematical programming problems : tools and applications
by: DomiÌnguez-Ballesteros, MariÌa BeleÌn
Published: (2001) -
A tolerance-tube approach to sequential quadratic programming with applications
by: Zoppke-Donaldson, Christine
Published: (1995) -
Contributions to Linear Programming Theory: Applications to Chebychev and Other Linear Approximation Criteria; The Transportation Problem; and the Problem of Resolution of Degeneracy in Linear programming Alyorithms
by: Appa, G. H.
Published: (1978)