Implicit function theorems for mathematical programming and for systems of inequalities

DOI10.1007/BF01580232zbMath0293.90032MaRDI QIDQ4045878

Norman Shapiro, James H. Bigelow

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (13)

Differential sensitivity of solutions of convex constrained optimal control problems for discrete systems ⋮ Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs ⋮ Sensitivity analysis in posynomial geometric programming ⋮ Sensitivity and stability analysis for nonlinear programming ⋮ Sensitivity analysis in geometric programming ⋮ On the directional derivative of the optimal solution mapping without linear independence constraint qualification ⋮ Sensitivity analysis for nonlinear programming using penalty methods ⋮ Stability in stochastic programming with recourse-estimated parameters ⋮ First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions ⋮ On parametric nonlinear programming ⋮ An implementation of some implicit function theorems with applications to sensitivity analysis ⋮ Sensitivity analysis in geometric programming: Theory and computations ⋮ Asymptotic normality of the optimal solution in response surface methodology

Cites Work

• On the continuity of the minimum set of a continuous function
• Marginal Values in Linear Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Implicit function theorems for mathematical programming and for systems of inequalities