Convex Semi-Infinite programming: explicit optimality conditions
We consider the convex Semi-In¯nite Programming (SIP) problem where objec- tive function and constraint function are convex w.r.t. a ¯nite-dimensional variable x and all of these functions are su±ciently smooth in their domains. The constraint function depends also on so called time variable t that...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/6234 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/6234 |