Characterizations of optimal solution sets of convex infinite programs

T.Q. Son ^[1] ; N. Dinh ^[2]
1. [1] Nhatrang College of Education, Vietnam
2. [2] Vietnam National University, Vietnam
Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 16, Nº. 1, 2008, págs. 147-163
Idioma: inglés
DOI: 10.1007/s11750-008-0039-2
Enlaces
- Texto completo (pdf)
Resumen
- In this paper, several Lagrange multiplier characterizations of the solution set of a convex infinite programming problem are given. Characterizations of solution sets of cone-constrained convex programs are derived as well. The procedure is then adopted to a semi-convex problem with convex constraints. For this problem, we present firstly a necessary and sufficient condition for optimality and secondly a characterization of its optimal solution set, based on a Lagrange multiplier associated with a given solution and on directional derivatives of the objective function.