Optimality conditions for nonlinear infinite programming problems

An infinite programming problem consists in minimizing a functional defined on a real Banach space under an infinite number of constraints. The main purpose of this article is to provide sufficient conditions of optimality under generalized convexity assumptions. Such conditions are necessarily sati...

Descripción completa

Detalles Bibliográficos
Autores: de Oliveira, Valeriano A. [UNESP], dos Santos, Lucelina B., Osuna-Gómez, Rafaela, Rojas-Medar, Marko A.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2015
País:Brasil
Institución:Universidade Estadual Paulista (UNESP)
Repositorio:Repositório Institucional da UNESP
Idioma:inglés
OAI Identifier:oai:repositorio.unesp.br:11449/167936
Acceso en línea:http://dx.doi.org/10.1007/s11590-014-0808-9
http://hdl.handle.net/11449/167936
Access Level:acceso abierto
Palabra clave:Generalized convexity
Infinite programming
Nonlinear programming
Sufficient conditions
Descripción
Sumario:An infinite programming problem consists in minimizing a functional defined on a real Banach space under an infinite number of constraints. The main purpose of this article is to provide sufficient conditions of optimality under generalized convexity assumptions. Such conditions are necessarily satisfied when the problem possesses the property that every stationary point is a global minimizer.