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 optimization