Pages that link to "Item:Q1315441"

The following pages link to Image space analysis of generalized fractional programs (Q1315441):

Displaying 44 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)
• Generating sum-of-ratios test problems in global optimization (Q597195) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
• Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
• On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
• Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
• Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
• A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (Q1804585) (← links)
• An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
• A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
• Resource allocation: a common set of weights model (Q2061304) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
• An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
• An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• A global optimization algorithm for linear fractional programming (Q2378922) (← links)
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
• Solving sum of ratios fractional programs via concave minimization (Q2465451) (← links)
• Global optimization for sum of linear ratios problem with coefficients (Q2493767) (← links)
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
• Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
• Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• (Q3384769) (← links)
• An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)