Some transformation techniques with applications in global optimization
From MaRDI portal
Publication:1029684
DOI10.1007/s10898-007-9223-4zbMath1169.90453MaRDI QIDQ1029684
Tapio Westerlund, Andreas Lundell, Joakim Westerlund
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9223-4
global optimization; signomial functions; mixed integer non-linear programming; transformation and convexification techniques
Related Items
A parsimonious model for generating arbitrage-free scenario trees, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Finding all global optima of engineering design problems with discrete signomial terms, Efficient Convexification Strategy for Generalized Geometric Programming Problems, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing, Global optimization of signomial geometric programming problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A reformulation framework for global optimization, A framework for globally optimizing mixed-integer signomial programs, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, A review of recent advances in global optimization, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Global optimization of nonconvex problems with convex-transformable intermediates, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks, A review of deterministic optimization methods in engineering and management, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, The supporting hyperplane optimization toolkit for convex MINLP, Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Univariate parameterization for global optimization of mixed-integer polynomial problems, Branch-reduction-bound algorithm for generalized geometric programming, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms, A practicable contraction approach for the sum of the generalized polynomial ratios problem, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Relaxations of factorable functions with convex-transformable intermediates, Global Optimization of Mixed-Integer Signomial Programming Problems
Uses Software
Cites Work
