Geometric Programming (GP) is a class of nonlinear optimization withmany useful theoretical and computational properties. Over the last fewyears, GP has been used to solve a variety of problems in the analysisand design of communication systems in several ‘layers’ in the commu-nication network architecture, including information theory problems,signal processing algorithms, ...

Compromise programming (CP) aims to find solutions by minimising distances an ideal point with maximum achievement which is usually infeasible. A common assumption in CP that it highly unlikely the optimum decision will lie out of bounds compromise set given metrics p = 1 $p=1$ and ∞ $p=\infty$ Minkowski distance function. This excludes use multiplicative functions as a measure achievement. We ...