Pages that link to "Item:Q1428180"

The following pages link to Global optimization of signomial geometric programming using linear relaxation. (Q1428180):

Displaying 33 items.

• Range division and contraction algorithm for a class of global optimization problems (Q279507) (← links)
• Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
• A new hybrid method for solving global optimization problem (Q426339) (← links)
• A continuous strategy to solve a class of mixed optimization problems (Q496673) (← links)
• The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
• A new global optimization algorithm for solving generalized geometric programming (Q624692) (← links)
• Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
• On generalized geometric programming problems with non-positive variables (Q857357) (← links)
• Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
• A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546) (← links)
• A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
• A robust algorithm for generalized geometric programming (Q934812) (← links)
• Global optimization for sum of geometric fractional functions (Q983970) (← links)
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
• Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach (Q2282675) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
• A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
• Global optimization for sum of generalized fractional functions (Q2479363) (← links)
• Accelerating method of global optimization for signomial geometric programming (Q2479370) (← links)
• A global optimization algorithm using linear relaxation (Q2507847) (← links)
• A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
• Global optimization for generalized geometric programming problems with discrete variables (Q2868905) (← links)
• A Continuous Strategy to Solve a Class of Discrete Optimization Problems (Q2883574) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)