Pages that link to "Item:Q1296128"
From MaRDI portal
The following pages link to An approximate approach of global optimization for polynomial programming problems (Q1296128):
Displaying 28 items.
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- An algebraic approach to integer portfolio problems (Q541725) (← links)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
- Some applications of a polynomial inequality to global optimization (Q948639) (← links)
- On the inventory model with continuous and discrete lead time, backorders and lost sales (Q967881) (← links)
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) (Q1376266) (← links)
- Global optimization of nonconvex polynomial programming problems having rational exponents (Q1387651) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← 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)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- A distributed computation algorithm for solving portfolio problems with integer variables (Q2462177) (← links)
- (Q3059324) (← links)
- (Q3748074) (← links)
- Approximation Methods for Polynomial Optimization (Q5390033) (← links)
- A three-echelon supply chain coordination with quantity discounts for multiple items (Q5416397) (← links)
- An integrated JIT--PQD model for enhancing buyer--supplier linkage (revised version) (Q5426641) (← links)
