Geometric programming

Known as: GP, Geometric program

A geometric program (GP) is an optimization problem of the form Minimize subject to where are posynomials and are monomials. In the context of…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

In this paper, we study the problem of determining the optimal association in multi-cell WLANs in the presence of hidden…

2008

Most existing methods of global optimization for generalized geometric programming (GGP) actually compute an approximate optimal…

2006

An optimization model is presented with a posynomial objective function subject to a fuzzy(relation) equations.Then the structure…

2005

In this paper, we propose unconstrained and constrained posynomial Geometric Programming (GP) problem with negative or positive…

2005

We first consider the problem of determining the doping profile that minimizes base transit time in a (homojunction) bipolar…

1999

In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use…

1979

A general or signomial geometric program is a nonlinear mathematical program involving general polynomials in several variables…

Review

1977

Review

1977

The paper gives a survey of computational strategies for geometric programming (posynomial and signomial form). It evaluates the…

1971

This paper derives, as optimal solutions of ordinary geometric programs, efficient and properly efficient solutions of geometric…

1970

This paper considers an efficient algorithm for finding the optimal design of a module under a special set of circumstances that…