Pages that link to "Item:Q2518145"

The following pages link to A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145):

Displaying 26 items.

• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
• Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
• A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
• An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
• A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
• An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• Fixed input allocation methods based on super CCR efficiency invariance and practical feasibility (Q2290884) (← links)
• An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
• Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
• Global optimization for generalized geometric programming problems with discrete variables (Q2868905) (← links)
• A new linearization technique for minimax linear fractional programming (Q2935390) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
• Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)