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 oonvex optimization, and these technuqucs are ...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 oonvex optimization, and these technuqucs are applied to the geometric programming and minimum discrimination information problems.展开更多
文摘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 oonvex optimization, and these technuqucs are applied to the geometric programming and minimum discrimination information problems.
