Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
From MaRDI portal
Publication:2397434
DOI10.1007/S10898-016-0451-3zbMATH Open1371.90111OpenAlexW2435552548MaRDI QIDQ2397434FDOQ2397434
Publication date: 22 May 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0451-3
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
global optimizationlinearizationgeneralized geometric programmingfree-sign variablespure discrete signomial
Cites Work
- A review of recent advances in global optimization
- Handbook of test problems in local and global optimization
- Deterministic global optimization. Theory, methods and applications
- Geometric Programming for Communication Systems
- A superior representation method for piecewise linear functions
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- Global Optimization of Mixed-Integer Signomial Programming Problems
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Global solution of optimization problems with signomial parts
- An efficient convexification method for solving generalized geometric problems
- A framework for globally optimizing mixed-integer signomial programs
- Title not available (Why is that?)
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
- Digital Circuit Optimization via Geometric Programming
- Convex relaxation for solving posynomial programs
- A geometric programming framework for univariate cubic \(L_1\) smoothing splines
- Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
- Base-2 Expansions for Linearizing Products of Functions of 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
Uses Software
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)
