ON THE KUHN-TUCKER THEOREM.

reportActive / Technical Report | Accession Number: AD0630119 | Need Help?

Abstract:

The general programming problem considered has the form minimize fx subject to g sub ix 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

Author(s):
Abadie, Jean
Author Organization(s):
OPERATIONS RESEARCH CENTER UNIV OF CALIF BERKELEY
Descriptive Note:
Revised ed.,
Supplementary Note:
Revision of manuscript submitted Jun 65.
Annotation:
On the Kuhn-Tucker theorem.
Pagination:
0027

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
ORC-65-18
Contract/Grant Number(s):
Nonr-222(83), DA-31-124-ARO(D)-331
Project Number(s):
NR-047-033
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*THEOREMS, MATHEMATICAL PROGRAMMING), (*LINEAR PROGRAMMING, THEORY), OPTIMIZATION
Field(s)/Group(s):
Operations Research
Keyword(s):
KUHN TUCKER THEOREM
Report Date:
1966 Feb 01