Implicit function theorems for mathematical programming and for systems of inequalities

DOI10.1007/BF01580232zbMATH Open0293.90032MaRDI QIDQ4045878FDOQ4045878

Authors: James H. Bigelow, Norman Shapiro 

Publication date: 1974

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the continuity of the minimum set of a continuous function
• Title not available (Why is that?)
• Marginal Values in Linear Programming

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045878)