Sensitivity analysis in geometric programming
type: Item
instance of: scholarly article
title: Sensitivity analysis in geometric programming
zbMATH Open document ID: 0458.90065
DOI: 10.1007/BF00934363
published in: Journal of Optimization Theory and Applications
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C99
zbMATH DE Number: 3718868
zbMATH Keywords: sensitivity equations
zbMATH Keywords: unique solution
zbMATH Keywords: sufficiently smooth nonlinear program
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: uniqueness conditions
zbMATH Keywords: computation of first-order derivatives
zbMATH Keywords: computation of higher-order derivatives
zbMATH Keywords: approximation of derivatives
author: Ron S. Dembo
MaRDI profile type: Publication
cites work: Computational experience in sensitivity analysis for nonlinear programming
cites work: Implicit function theorems for mathematical programming and for systems of inequalities
cites work: Sensitivity analysis for nonlinear programming using penalty methods
cites work: Technical Note—On Sensitivity Analysis in Geometric Programming
cites work: Constrained Entropy Models; Solvability and Sensitivity
cites work: Q5557595
cites work: Dual to primal conversion in geometric programming
cites work: Q5588268
cites work: The Generic Nature of Optimality Conditions in Nonlinear Programming
cites work: Second order algorithms for the posynomial geometric programming dual, part I: Analysis
full work available at URL: https://doi.org/10.1007/bf00934363
OpenAlex ID: W2046885415
description: scientific article; zbMATH DE number 3718868