Univariate parameterization for global optimization of mixed-integer polynomial problems
New approach for transforming polynomial MINLP into MILP. Approximating upper bounding and relaxation lower bounding formulations are given. Bilinear term is basic building block where one variable is discretized. Base-2 to base-10 numeric representation systems can be employed. Problem size increases logarithmically with number of discrete points, optimality gap decreases linearly.
global optimization non-linear programming integer programming mixed-integer non-linear programming