Implicit function theorems for mathematical programming and for systems of inequalities
暂无分享,去创建一个
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.
[1] A. Williams. Marginal Values in Linear Programming , 1963 .
[2] Lloyd S. Shapley,et al. Mass Action Laws and the Gibbs Free Energy Function , 1965 .
[3] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[4] G. Dantzig,et al. On the continuity of the minimum set of a continuous function , 1967 .
[5] H. Mills. 8. Marginal Values of Matrix Games and Linear Programs , 1957 .