Pages that link to "Item:Q2465451"

The following pages link to Solving sum of ratios fractional programs via concave minimization (Q2465451):

Displaying 14 items.

• A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
• Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem (Q727378) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
• Least trimmed squares regression, least median squares regression, and mathematical program\-ming (Q1876766) (← links)
• Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
• Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
• Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• Alternative branching rules for some nonconvex problems (Q2943824) (← links)
• On the quadratic fractional optimization with a strictly convex quadratic constraint (Q2948116) (← links)
• (Q3384769) (← links)