Abstract
In the present paper, some strategies for transforming integer bilinear functions into convex form are presented. Bilinear functions are non-convex and for such functions, no straightforward methods for finding the optimal solution exist. What makes the case in this paper especially interesting is the fact that the variables appearing in the bilinear function are all integers. The transformations are followed by an example and a comparison of the strategies applied to an originally non-convex mixed integer non-linear programming (MINLP) problem, the trim-loss problem. The example is based on trim-optimization problems encountered at a Finnish paper converting mill.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.