| Article ID: | iaor19932386 |
| Country: | Serbia |
| Volume: | 1 |
| Start Page Number: | 3 |
| End Page Number: | 14 |
| Publication Date: | Dec 1991 |
| Journal: | Yugoslav Journal of Operations Research |
| Authors: | Zlobec Sanjo |
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.