Branch-and-bound reduction type method for semi-infinite programming
Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here, we present a new reduction method for SIP, where the multi-local optimization is carried out with a multi-local branch-and-bound method, the reduced (finite) problem is approximately solved by an inte...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/14490 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/14490 |