ON THE KUHN-TUCKER THEOREM.
OPERATIONS RESEARCH CENTER UNIV OF CALIF BERKELEY
Pagination or Media Count:
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
- Operations Research