Implicit function theorems for mathematical programming and for systems of inequalities

DOI10.1007/BF01580232MaRDI QIDQ4045878zbMATH OpenFDO

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

• scientific article; zbMATH DE number 3121288 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Marginal Values in Linear Programming
• On the continuity of the minimum set of a continuous function

Cited in

(13)

• Sensitivity analysis for nonlinear programming using penalty methods
• 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

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)