Pages that link to "Item:Q1296128"

The following pages link to An approximate approach of global optimization for polynomial programming problems (Q1296128):

Displaying 14 items.

• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• An algebraic approach to integer portfolio problems (Q541725) (← links)
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
• On the inventory model with continuous and discrete lead time, backorders and lost sales (Q967881) (← links)
• An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
• An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
• A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
• A global optimization method for nonconvex separable programming problems (Q1847169) (← links)
• On the posynomial fractional programming problems (Q1848628) (← links)
• Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials (Q1883192) (← links)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
• A distributed computation algorithm for solving portfolio problems with integer variables (Q2462177) (← links)