A reduction type method for solving semi-infinite programming problems
We present a reduction method for solving semi-infinite programming problems based on simulated annealing method equipped with a function stretching as a multi-local procedure and the penalty technique to solve the sequence of finite problems. To guarantee the global convergence of the algorithm we...
Autor principal: | |
---|---|
Outros Autores: | |
Formato: | conferenceObject |
Idioma: | eng |
Publicado em: |
2011
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10198/4730 |
País: | Portugal |
Oai: | oai:bibliotecadigital.ipb.pt:10198/4730 |