ON THE KUHN-TUCKER THEOREM.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1966
- Accession Number
- AD0630119
Entities
People
- Jean Abadie