Reduction method with simulated annealing for semi-infinite programming
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,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/4854 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/4854 |