Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
From MaRDI portal
Publication:2397434
Recommendations
- An enhanced logarithmic method for signomial programming with discrete variables
- 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
- On the mixed integer signomial programming problems
- Global optimization for generalized geometric programs with mixed free-sign variables
Cites work
- scientific article; zbMATH DE number 2068063 (Why is no real title available?)
- A framework for globally optimizing mixed-integer signomial programs
- A geometric programming framework for univariate cubic L₁ smoothing splines
- A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
- A review of recent advances in global optimization
- A superior representation method for piecewise linear functions
- An efficient convexification method for solving generalized geometric problems
- Base-2 expansions for linearizing products of functions of discrete variables
- Convex relaxation for solving posynomial programs
- Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
- Deterministic global optimization. Theory, methods and applications
- Digital Circuit Optimization via Geometric Programming
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Geometric Programming for Communication Systems
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization of mixed-integer signomial programming problems
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Global solution of optimization problems with signomial parts
- Handbook of test problems in local and global optimization
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Some transformation techniques with applications in global optimization
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
Cited in
(3)
This page was built for publication: Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397434)
