Pages that link to "Item:Q1779583"
From MaRDI portal
The following pages link to Global optimization of generalized geometric programming (Q1779583):
Displaying 29 items.
- Range division and contraction algorithm for a class of global optimization problems (Q279507) (← links)
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A new global optimization algorithm for solving generalized geometric programming (Q624692) (← links)
- Optimality criteria for general unconstrained geometric programming problems (Q811403) (← links)
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty (Q849071) (← links)
- A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- A robust algorithm for generalized geometric programming (Q934812) (← links)
- GMG -- a guaranteed global optimization algorithm: application to remote sensing (Q1025687) (← links)
- Second-order method of generalized geometric programming for spatial frame optimization (Q1371756) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- Using geometric arithmetic mean to solve non-linear fractional programming problems (Q2170967) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- Global optimization reduction of generalized Malfatti's problem (Q2358905) (← links)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
- A deterministic global optimization algorithm for generalized geometric programming (Q2572718) (← links)
- Global optimization for generalized geometric programming problems with discrete variables (Q2868905) (← links)
- An efficient global approach for posynomial geometric programming problems (Q2899141) (← links)
- Generalized geometric programming with many equality constraints (Q4725635) (← links)
- (Q4885955) (← links)
- (Q4980717) (← links)