Random test examples with known minimum for convex semi-infinite programming problems
A signi cant research activity has occurred in the area of convex semi- in nite optimization in the recent years. Many new theoretical, algorithm and computational contribution has been obtained . Despite these numerous con- tributions, there still exits a lack of representative convex semi-in nite...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/19118 |
| Acceso en línea: | https://hdl.handle.net/2117/19118 |
| Access Level: | acceso abierto |
| Palabra clave: | Mathematical optimization Optimització matemàtica Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica |
| Sumario: | A signi cant research activity has occurred in the area of convex semi- in nite optimization in the recent years. Many new theoretical, algorithm and computational contribution has been obtained . Despite these numerous con- tributions, there still exits a lack of representative convex semi-in nite test problems. Test problems are of major importance for researchers interested in the algorithmic development. This article is motivated by the scarcity of con- vex semi-in nite test problems and describes a procedure for generating convex semi-in nite families of test problems with optimal solution and optimal value known. |
|---|