| Article ID: | iaor19912112 |
| Country: | Netherlands |
| Volume: | 10 |
| Issue: | 1 |
| Start Page Number: | 57 |
| End Page Number: | 60 |
| Publication Date: | Feb 1991 |
| Journal: | Operations Research Letters |
| Authors: | Ferris M.C., Burke J.V. |
This paper gives several characterizations of the solution set of convex programs. No differentiability of the functions involved in the problem definition is assumed. The result is a generalization of the results given. Furthermore, the subgradients attaining the minimum principle are explicitly characterized, and this characterization is shown to be independent of any solution.