During the last years, an increasing interest in geometric programming (GP) can be observed. Advances in numerical methods allow to solve large GPs and new areas of successful applications have emerged: besides of technical applications, there are also GPs for optimal production planning, finance, etc. In real-life applications of GP, some of coefficients and/or exponents need not be precisely ...

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 errors in the coefficients; for example...

Presently the design of the optimal analog and mixed signal (AMS) circuits with lesser design cycle time is a great challenge for the designers. This paper describes the optimization of the current starved voltage controlled oscillator (CSVCO) circuit. The objective functions and constraints of the CSVCO circuit are in the form of posynomial functions of the design variables. The convex optimiz...

The geometric programming problem (GP) is to minimize a posynomial g(t) = I ∑

This paper studies a new approach to analyze the large deflection behavior of prismatic and non-prismatic beams of non-homogenous material under combined load and multiple boundary conditions. The mathematical formulation has been derived which led to a set of six first-order ordinary differential equations. The geometric nonlinearity was solved numerically using the multiple shooting method co...