Sensitivity analysis for a linearized method of geometric programming
- 1 February 1977
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 8 (2) , 153-161
- https://doi.org/10.1080/00207727708942031
Abstract
Using the variation of certain parameters in the direction of the gradient, a sensitivity analysis is performed here in respect of a linearized method of simplex-type computation for problems of geometric programming, which minimize a polynomial with polynomial constraints. The illustrative applications show the relative flexibility and efficiency of the computational method which has considerable scope of application in dynamic problems of intertemporal optimizationKeywords
This publication has 1 reference indexed in Scilit:
- Linearizing Geometric ProgramsSIAM Review, 1970