Pages that link to "Item:Q1187374"
From MaRDI portal
The following pages link to A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374):
Displayed 50 items.
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- Computational method for the profit bounds of inventory model with interval demand and unit cost (Q864804) (← links)
- An inverse reliability-based approach for designing under uncertainty with application to robust piston design (Q868632) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Fuzzy profit measures for a fuzzy economic order quantity model (Q949990) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- On the posynomial fractional programming problems (Q1848628) (← links)
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200) (← links)
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal (Q1881682) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- Inventory and investment in setup and quality operations under return on investment maximization (Q2455619) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- Extremal problems for convex polygons (Q2460117) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- On the mixed integer signomial programming problems (Q2573603) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- The eigenvalue complementarity problem (Q2643627) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)