Pages that link to "Item:Q1187369"
From MaRDI portal
The following pages link to Reduction of indefinite quadratic programs to bilinear programs (Q1187369):
Displayed 13 items.
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← 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)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Multi-objective geometric programming problem with \(\epsilon\)-constraint method (Q1991380) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)