A new convergent algorithm for the continuous modular design problem

Abstract EN

-The well known continuous modular design problem is considered in this paper.

Fully utilizing the special structure of the corresponding geometric programming problem and its dual a new algorithm is derived.

This algorithm is based on the subsequent solution of generalized Konig problems, which provides either an optimal solution or a direction to improve the objective.

By computing the maximal possible increment, a strict improvement of the primal objective is obtained in each iterational step.

A simple proof of convergence is presented in the last section