Pages that link to "Item:Q1781967"

The following pages link to Conical partition algorithm for maximizing the sum of dc ratios (Q1781967):

Displaying 17 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)
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
• Computing non-dominated solutions in MOLFP (Q877640) (← links)
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
• Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
• Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
• Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
• An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
• Resource allocation: a common set of weights model (Q2061304) (← links)
• A parametric solution method for a generalized fractional programming problem (Q2065366) (← 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)
• Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis (Q2969968) (← links)
• A sixth bibliography of fractional programming (Q3426331) (← links)