Accession Number : AD0630119

Title :   ON THE KUHN-TUCKER THEOREM.

Descriptive Note : Revised ed.,

Corporate Author : OPERATIONS RESEARCH CENTER UNIV OF CALIF BERKELEY

Personal Author(s) : Abadie,Jean

Report Date : FEB 1966

Pagination or Media Count : 27

Abstract : The general programming problem considered has the form: minimize f(x) subject to g sub i(x) = o, i = 1,2,..., m. The regularity condition of Cottle is first generalized so that any linear system satisfies a (new) regularity condition. It is then proven that this regularity condition is actually a sufficient criterion for a certain weakened form of the Kuhn-Tucker constraint qualification property. Finally, a further generalization of the latter property is given. (Author)

Descriptors :   (*THEOREMS, MATHEMATICAL PROGRAMMING), (*LINEAR PROGRAMMING, THEORY), OPTIMIZATION

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE