Orthogonal-convex optimization is an objective and
constraint based mathematical optimization technique [5], [7];
where the objective and constraints are modeled as monomial
or posynomial by exact formulation or approximation prior to
optimization. Any duly formulated problem can be optimized
with efficiency and ease. It is represented as: