摘要： Most nonliner programming problems consist of functions which are sums of unary,convexfunctions of linear fuctions.In this paper.we derive the duality forms of the unary oonvex optimization,and these technuqucs are applied to the geometric programming and minimum discrimination informationproblems.
