dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Federal do Paraná (UFPR)
dc.contributorGMA, Departamento de Ciencias Básicas, Facultad de Ciencias, Universidad del Bío-Bío
dc.date.accessioned2018-12-11T16:38:56Z
dc.date.available2018-12-11T16:38:56Z
dc.date.created2018-12-11T16:38:56Z
dc.date.issued2015-08-29
dc.identifierOptimization Letters, v. 9, n. 6, p. 1131-1147, 2015.
dc.identifier1862-4480
dc.identifier1862-4472
dc.identifierhttp://hdl.handle.net/11449/167936
dc.identifier10.1007/s11590-014-0808-9
dc.identifier2-s2.0-84938294219
dc.identifier2-s2.0-84938294219.pdf
dc.description.abstractAn 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.
dc.languageeng
dc.relationOptimization Letters
dc.relation0,721
dc.relation0,721
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectGeneralized convexity
dc.subjectInfinite programming
dc.subjectNonlinear programming
dc.subjectSufficient conditions
dc.titleOptimality conditions for nonlinear infinite programming problems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución