摘 要: | It is found that generalized geometric programming (GGP) is in fact a special case of generalized convex programming. By selecting a suitable bifunetion and calculating its adjoint function, the dual form of the standard GGP problem is derived. Some duality theorems are also obtained with this point of view. The method used is simpler and more general than what appeared in the literature.
|