.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Signomial programming
Mixed 0-1 linear programming
Linearization technique
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveAn Adaptive Hierarchical Sliding Mode Controller for Autonomous Underwater Vehicles.png)
Electronics
OAAI
ElectronicsIF0
OAAIShareSaveAn optimization approach for solving signomial discrete programming problems with free variables
PREAI
ShareSaveShareSave View more