Abstract
Geometric programming is a mathematical method for restricted optimization of a certain kind of polynomial functions. The purpose of this paper is to apply this method to a problem of preliminary fleet operations analysis. Three versions of this problem are fully discussed with a view to present a working knowledge for the general application of this method to other problems of ship design and operation. The paper is subdivided in two parts, which are both self-consistent. Part I deals with the construction of a transportation model with a number of variants. Results are given without discussion of the method used for solution. The latter is explained in Part II, which contains an exposition of the theory of geometric programming.
The paper has been prepared in part-time co-operation with the Netherlands Ship Model Basin at Wageningen.
Get full access to this article
View all access options for this article.