Pages that link to "Item:Q953379"

The following pages link to A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379):

Displaying 12 items.

• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
• Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
• A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
• Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
• Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
• A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
• Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region (Q2511139) (← links)
• A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
• Optimising portfolio diversification and dimensionality (Q2679246) (← links)