Exploring the convex transformations for solving non-convex bilinear integer problems

Iiro Harjunkoski

doi:10.1016/S0098-1354(99)80116-1

Return

Exploring the convex transformations for solving non-convex bilinear integer problems

1999-06-01

PRE

Iiro Harjunkoski *

Ray Pörn

Tapio Westerlund

DOI：10.1016/S0098-1354(99)80116-1

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

mixed-integer nonlinear programming

convex transformation

trim-loss problem

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.