A reduction type method for solving semi-infinite programming problems

• Autor(es): Pereira, Ana I. ; Fernandes, Edite M.G.P.
• Data: 2006
• Identificador Persistente: http://hdl.handle.net/10198/4730
• Origem: Biblioteca Digital do IPB
• Assunto(s): Semi-infinite programming; Nonlinear optimization
• Tipo de Documento: Documento de conferência
• Idioma: Inglês

Descrição

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 use an extension of penalty merit function. Our preliminary numerical results seem to show that the algorithm has a satisfactory computational behaviour.