On Sensitivity Analysis in Geometric Programming

This note develops efficient sensitivity procedures for posynomial geometric programs. These procedures provide ranging information for the primal coefficients, means for dealing with problems with loose primal constraints, and an incremental procedure for improving the estimated solutions. These se...

Full description

Saved in:
Bibliographic Details
Published in:Operations research 1977-01, Vol.25 (1), p.155-163
Main Authors: Dinkel, John J., Kochenberger, Gary A.
Format: Article
Language:English
Subjects:
Coefficients
Geometric programming
Mathematical procedures
Optimal solutions
Sensitivity analysis
Technical Notes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This note develops efficient sensitivity procedures for posynomial geometric programs. These procedures provide ranging information for the primal coefficients, means for dealing with problems with loose primal constraints, and an incremental procedure for improving the estimated solutions. These sensitivity procedures are independent of the method of solution of the geometric program.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.25.1.155