Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables

DOI10.1016/j.apm.2017.09.047zbMath1480.90258OpenAlexW2762723962MaRDI QIDQ2295318

Shu-Cherng Fang, Han-Lin Li, Tiantian Nie, Qi An

Publication date: 12 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2017.09.047

zbMATH Keywords

polynomial programmingnonlinear discrete optimizationsignomial programminglinear reformulation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cites Work

• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• A tutorial on geometric programming
• Representability in mixed integer programming. I: Characterization results
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• Approximating separable nonlinear functions via mixed zero-one programs
• An enhanced logarithmic method for signomial programming with discrete variables
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Review of nonlinear mixed-integer and disjunctive programming techniques
• A global optimization algorithm for linear fractional and bilinear programs
• A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
• Univariate parameterization for global optimization of mixed-integer polynomial problems
• Incremental and encoding formulations for mixed integer programming
• Generalized Benders decomposition
• Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
• A set of geometric programming test problems and their solutions
• Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Integer Polynomial Optimization in Fixed Dimension
• Linear Reformulation of Polynomial Discrete Programming for Fast Computation
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming

This page was built for publication: Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables