.png){kind=icon}
返回
Exploring the convex transformations for solving non-convex bilinear integer problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-1354(99)80116-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
mixed-integer nonlinear programming
convex transformation
trim-loss problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
.png){kind=icon}
