Geodesic
Characterizing Optimality in Nonconvex Optimizationi
Yugoslav journal of operations research, Tome 1 (1991) no. 1, p. 3 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

A saddle—point condition, that is both necessary and sufficient for a feasible point to be globally optimal, is given for a large class of nonconvex programming problems. The condition assumes lower semicontinuity of the feasible set point-to-set mapping.
Keywords: nonconvex program, convex program, saddle point, point- to-set mapping, optimality conditions 
@article{YJOR_1991_1_1_a0,
     author = {Sanjo Zlobec},
     title = {Characterizing {Optimality}  in {Nonconvex} {Optimizationi}},
     journal = {Yugoslav journal of operations research},
     pages = {3 },
     year = {1991},
     volume = {1},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a0/}
}
TY  - JOUR
AU  - Sanjo Zlobec
TI  - Characterizing Optimality  in Nonconvex Optimizationi
JO  - Yugoslav journal of operations research
PY  - 1991
SP  - 3 
VL  - 1
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a0/
LA  - en
ID  - YJOR_1991_1_1_a0
ER  - 
%0 Journal Article
%A Sanjo Zlobec
%T Characterizing Optimality  in Nonconvex Optimizationi
%J Yugoslav journal of operations research
%D 1991
%P 3 
%V 1
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a0/
%G en
%F YJOR_1991_1_1_a0
Sanjo Zlobec. Characterizing Optimality  in Nonconvex Optimizationi. Yugoslav journal of operations research, Tome 1 (1991) no. 1, p. 3 . http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a0/