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...

Full description

Bibliographic Details
Main Author: Pereira, Ana I. P. N. (author)
Other Authors: Fernandes, Edite Manuela da G. P. (author)
Format: conferencePaper
Language:eng
Published: 2011
Subjects:
Semi-infinite programming
Reduction method
Branch-and-bound
Nonlinear optimization
Global optimization
Science & Technology
Online Access:http://hdl.handle.net/1822/14490
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/14490

Internet

http://hdl.handle.net/1822/14490

Similar Items