Global optimization of nonconvex polynomial programming problems having rational exponents
From MaRDI portal
Publication:1387651
DOI10.1023/A:1008249414776zbMath0905.90146OpenAlexW2040529625MaRDI QIDQ1387651
Publication date: 8 June 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008249414776
global optimizationbranch-and-boundreformulation-linearization techniquenonconvex polynomial programming
Related Items
A review of recent advances in global optimization, On generalized geometric programming problems with non-positive variables, Branch-reduction-bound algorithm for generalized geometric programming, A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation, Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models, A global optimization using linear relaxation for generalized geometric programming, A global optimization algorithm for signomial geometric programming problem, Global optimization of signomial geometric programming using linear relaxation., Global optimality conditions and optimization methods for polynomial programming problems, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents, Multi-objective geometric programming problem with \(\epsilon\)-constraint method, Global optimization for sum of generalized fractional functions, Linearization method of global optimization for generalized geometric programming, Global optimization of nonlinear sum of ratios problem, A new two-level linear relaxed bound method for geometric programming problems, Global optimization for sum of geometric fractional functions, Global optimization of generalized geometric programming, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, Relative Entropy Relaxations for Signomial Optimization, Reformulations in Mathematical Programming: Definitions and Systematics, A geometric branch and bound method for robust maximization of convex functions, A tutorial on geometric programming, Newton polytopes and relative entropy optimization, A branch and bound algorithm to globally solve the sum of several linear ratios, On the posynomial fractional programming problems, Univariate parameterization for global optimization of mixed-integer polynomial problems
Uses Software
