ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Implicit function formulas for differentiating the solutions of mathematical programming problems satisfying the conditions of the Kuhn—Tucker theorem are motivated and rigorously demonstrated. The special case of a convex objective function with linear constraints is also treated with emphasis on computational details. An example, an application to chemical equililibrium problems, is given. Implicit function formulas for differentiating the unique solution of a system of simultaneous inequalities are also derived.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580232