The Kuhn-Tucker Theorem in Concave Programming

Hirofumi Uzawa

A chapter in Traces and Emergence of Nonlinear Programming, 2014, pp 307-312 from Springer

Abstract: Abstract In order to solve problems of constrained extrema, it is customary in the calculus to use the method of the Lagrangian multiplier. Let us, for example, consider a problem: maximize f(x1,•••, xn) subject to the restrictions g(x1,•••, xn)=0 (k=1, • ••,m).

Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-0439-4_15

Ordering information: This item can be ordered from
http://www.springer.com/9783034804394

DOI: 10.1007/978-3-0348-0439-4_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().