A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions

DOI10.1016/j.disopt.2012.10.001zbMath1258.90053OpenAlexW2001729361MaRDI QIDQ1941533

Hao-Chun Lu

Publication date: 13 March 2013

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.10.001

zbMATH Keywords

discrete functionmixed-integer non-linear programmingfree-sign variables

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (5)

Finding all global optima of engineering design problems with discrete signomial terms ⋮ Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement ⋮ An enhanced logarithmic method for signomial programming with discrete variables ⋮ Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables

This page was built for publication: A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions