Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/5884
Título: Assessment of a hybrid approach for nonconvex constrained MINLP problems
Autor: Fernandes, Florbela P.
Costa, M. Fernanda
Fernandes, Edite M.G.P.
Palavras-chave: Mixed-integer programming
Genetic algorithm
Data: 2011
Editora: J Vigo-Aguiar
Citação: Fernandes, Florbela P.; Costa, M. Fernanda P.; Fernandes, Edite M. G. P. (2011). Assessment of a hybrid approach for nonconvex constrained MINLP problems. In CMMSE 2011. Benidorm, Spain. p.484-495. ISBN 978‐84-614-6167-7.
Resumo: A methodology to solve nonconvex constrained mixed-integer nonlinear programming (MINLP) problems is presented. A MINLP problem is one where some of the variables must have only integer values. Since in most applications of the industrial processes, some problem variables are restricted to take discrete values only, there are real practical problems that are modeled as nonconvex constrained MINLP problems. An efficient deterministic method for solving nonconvex constrained MINLP may be obtained by using a clever extension of Branch-and-Bound (B&B) method. When solving the relaxed nonconvex nonlinear programming subproblems that arise in the nodes of a tree in a B&B algorithm, using local search methods, only convergence to local optimal solutions is guaranteed. Pruning criteria cannot be used to avoid an exhaustive search in the search space. To address this issue, we propose the use of a genetic algorithm to promote convergence to a global optimum of the relaxed nonconvex NLP subproblem. We present some numerical experiments with the proposed algorithm.
Peer review: yes
URI: http://hdl.handle.net/10198/5884
ISBN: 978‐84-614-6167-7
Aparece nas colecções:ESTiG - Artigos em Proceedings Não Indexados à WoS/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
cmmse_FF_FC_EF.pdf138,88 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.