Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.
|Original language||English (US)|
|Number of pages||8|
|State||Published - Dec 1976|
All Science Journal Classification (ASJC) codes