An approximate approach of global optimization for polynomial programming problems

DOI10.1016/S0377-2217(96)00310-4zbMath0943.90079OpenAlexW2152856948MaRDI QIDQ1296128

Ching-Ter Chang, Han-Lin Li

Publication date: 13 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00310-4

zbMATH Keywords

global optimizationlinearizationpolynomial program

Mathematics Subject Classification ID

Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items

Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ A three-echelon supply chain coordination with quantity discounts for multiple items ⋮ On the inventory model with continuous and discrete lead time, backorders and lost sales ⋮ An algebraic approach to integer portfolio problems ⋮ An integrated JIT--PQD model for enhancing buyer--supplier linkage (revised version) ⋮ An efficient algorithm for range computation of polynomials using the Bernstein form ⋮ An efficient linearization approach for mixed-integer problems ⋮ A linearization method for mixed 0--1 polynomial programs ⋮ A global optimization method for nonconvex separable programming problems ⋮ On the posynomial fractional programming problems ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems

Cites Work

• Unnamed Item
• Constrained global optimization: algorithms and applications
• More test examples for nonlinear programming codes
• An analytical approach to global optimization
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• An approximate method for local optima for nonlinear mixed integer programming problems
• Test example for nonlinear programming codes
• A global approach for general \(0-1\) fractional programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Stochastic global optimization methods part I: Clustering methods