New geometric programming algorithms with numerical experiments

Abstract

Geometric programming (GP) is one of the most important parts of mathematical programming. GP models are widely applied in different spheres of science, technology, national economy [1,2]. The paper presents six new algorithms of linear and polynomial approximation for the solution of GP programs. The results of extensive numerical experiments are also included in the paper. They indicate the effectiveness of the proposed methods.