.png){kind=icon}
返回
An enhanced logarithmic method for signomial programming with discrete variables
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.05.063.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Signomial programming problems with discrete variables (SPD) appear widely in real-life applications, but they are hard to solve. This paper proposes an enhanced logarithmic method to reformulate the SPD problem as a mixed 0-1 linear program (MILP) with a minimum number of binary variables and inequality constraints. Both of the theoretical analysis and numerical results strongly support its superior performance to other state-of-the-art linearization methods. We also extend the proposed method to linearize some more complicated problems involving product and fractional terms in discrete and continuous variables. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Signomial programming
Mixed 0-1 linear programming
Linearization technique
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏An Adaptive Hierarchical Sliding Mode Controller for Autonomous Underwater Vehicles.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏An optimization approach for solving signomial discrete programming problems with free variables
PREAI
分享收藏
查看更多内容