Reduction method with simulated annealing for semi-infinite programming
Main Author: | |
---|---|
Publication Date: | 2004 |
Other Authors: | |
Language: | eng |
Source: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
Download full: | http://hdl.handle.net/10198/4854 |
Summary: | Semi-infinite programming (SIP) problems are characterized by a finite number of variables and an infinite number of constraints. The class of the reduction methods is based on the idea that, under certain conditions, it is possible to replace the infinite constraints by a finite set of constraints, that are locally sufficient to define the feasible region of the SIP problem. We propose a new reduction method based on a simulated annealing algorithm for multi-local optimization and the penalty method for solving the finite problem. |
id |
RCAP_7e02cd4cd8f68419a3bc52fce98305ea |
---|---|
oai_identifier_str |
oai:bibliotecadigital.ipb.pt:10198/4854 |
network_acronym_str |
RCAP |
network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository_id_str |
https://opendoar.ac.uk/repository/7160 |
spelling |
Reduction method with simulated annealing for semi-infinite programmingSemi-infinite programmingNonlinear optimizationSemi-infinite programming (SIP) problems are characterized by a finite number of variables and an infinite number of constraints. The class of the reduction methods is based on the idea that, under certain conditions, it is possible to replace the infinite constraints by a finite set of constraints, that are locally sufficient to define the feasible region of the SIP problem. We propose a new reduction method based on a simulated annealing algorithm for multi-local optimization and the penalty method for solving the finite problem.Biblioteca Digital do IPBPereira, Ana I.Fernandes, Edite M.G.P.2011-06-01T11:28:27Z20042004-01-01T00:00:00Zconference objectinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10198/4854engPereira, Ana I.; Fernandes, Edite M.G.P. (2004). Reduction method with simulated annealing for semi-infinite programming. In 12th French-German-Spanish Conference on Optimization. Avignon - France.info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-02-25T11:58:04Zoai:bibliotecadigital.ipb.pt:10198/4854Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T11:21:00.551404Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
dc.title.none.fl_str_mv |
Reduction method with simulated annealing for semi-infinite programming |
title |
Reduction method with simulated annealing for semi-infinite programming |
spellingShingle |
Reduction method with simulated annealing for semi-infinite programming Pereira, Ana I. Semi-infinite programming Nonlinear optimization |
title_short |
Reduction method with simulated annealing for semi-infinite programming |
title_full |
Reduction method with simulated annealing for semi-infinite programming |
title_fullStr |
Reduction method with simulated annealing for semi-infinite programming |
title_full_unstemmed |
Reduction method with simulated annealing for semi-infinite programming |
title_sort |
Reduction method with simulated annealing for semi-infinite programming |
author |
Pereira, Ana I. |
author_facet |
Pereira, Ana I. Fernandes, Edite M.G.P. |
author_role |
author |
author2 |
Fernandes, Edite M.G.P. |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Biblioteca Digital do IPB |
dc.contributor.author.fl_str_mv |
Pereira, Ana I. Fernandes, Edite M.G.P. |
dc.subject.por.fl_str_mv |
Semi-infinite programming Nonlinear optimization |
topic |
Semi-infinite programming Nonlinear optimization |
description |
Semi-infinite programming (SIP) problems are characterized by a finite number of variables and an infinite number of constraints. The class of the reduction methods is based on the idea that, under certain conditions, it is possible to replace the infinite constraints by a finite set of constraints, that are locally sufficient to define the feasible region of the SIP problem. We propose a new reduction method based on a simulated annealing algorithm for multi-local optimization and the penalty method for solving the finite problem. |
publishDate |
2004 |
dc.date.none.fl_str_mv |
2004 2004-01-01T00:00:00Z 2011-06-01T11:28:27Z |
dc.type.driver.fl_str_mv |
conference object |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10198/4854 |
url |
http://hdl.handle.net/10198/4854 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Pereira, Ana I.; Fernandes, Edite M.G.P. (2004). Reduction method with simulated annealing for semi-infinite programming. In 12th French-German-Spanish Conference on Optimization. Avignon - France. |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
repository.mail.fl_str_mv |
info@rcaap.pt |
_version_ |
1833591829185953792 |