Implicit Function Theorems for Optimization Problems 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 c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bigelow,James H, Shapiro,Norman Z
Format:	Report
Sprache:	eng
Schlagworte:	Convex sets Implicit function Theorems Inequalities Kuhn-Tucker theorem Mathematical programming Operations Research Optimization Partial differential equations Theorems
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!