A. J. Federowicz

Learn More
This paper develops a simple bounding procedure for the optimal value of a posynomial geometric programming (GP) problem when some of the coefficients for terms in the problem's objective function are estimated with error. The bound may be computed even before the problem is solved and it is shown analytically that the optimum value is very insensitive to(More)
  • 1