Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
