An enhanced logarithmic method for signomial programming with discrete variables
From MaRDI portal
Publication:1752141
Recommendations
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- On the mixed integer signomial programming problems
- A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Linear reformulation of polynomial discrete programming for fast computation
Cites work
- A Broader View of Designing the Liver Allocation System
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
- A note on ``A superior representation method for piecewise linear functions
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A review of deterministic optimization methods in engineering and management
- A review of recent advances in global optimization
- A tutorial on geometric programming
- Allocating objects in a network of caches: centralized and decentralized analyses
- An improved linearization strategy for zero-one quadratic programming problems
- Base-2 expansions for linearizing products of functions of discrete variables
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Customized Bundle Pricing for Information Goods: A Nonlinear Mixed-Integer Programming Approach
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Global optimization for generalized geometric programs with mixed free-sign variables
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- Introduction to Operations Research
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Representability in mixed integer programming. I: Characterization results
- Surrogate Constraint Duality in Mathematical Programming
Cited in
(7)- A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Finding all global optima of engineering design problems with discrete signomial terms
- Linear reformulation of polynomial discrete programming for fast computation
This page was built for publication: An enhanced logarithmic method for signomial programming with discrete variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752141)
