Modular Design: An Application of Structured Geometric Programming

Abstract

This paper considers an efficient algorithm for finding the optimal design of a module under a special set of circumstances that prevail in the design of a module for logistical applications. The method is based on primal-dual relations between generalized polynomial minimization and its quasi dual.