Pages that link to "Item:Q2427180"

The following pages link to A global optimization using linear relaxation for generalized geometric programming (Q2427180):

Displaying 15 items.

• Range division and contraction algorithm for a class of global optimization problems (Q279507) (← links)
• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• A model-hybrid approach for unconstrained optimization problems (Q403087) (← links)
• A new hybrid method for solving global optimization problem (Q426339) (← links)
• Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
• A novel mutation operator based on the immunity operation (Q1015010) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• Hybrid optimization procedure applied to optimal location finding for piezoelectric actuators and sensors for active vibration control (Q2306822) (← links)
• Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
• A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
• Global optimization for generalized geometric programming problems with discrete variables (Q2868905) (← links)
• (Q3384775) (← links)