Exploring the convex transformations for solving non-convex bilinear integer problems
In the present paper some methods to transform a non-convex bilinear mixed-integer programming problem are considered in more detail. The methods have been applied in solving the trim-loss problem with MINLP methods and even if the transformations lead to a global optimal solution, there are some variable properties that affect the solution performance. The properties are explored by systematically solving a set of example problems with modified transformation techniques and analyzing the results.
convex transformation trim-loss problem mixed-integer nonlinear programming