论文部分内容阅读
Most nonliner programming problems consist of functions which are sums of unary convex functions of linear fuctions.In this paper,we derive the duality forms of the unary convex optimization,and these technuques are applied to the geometric programming an