Pages that link to "Item:Q2493767"
From MaRDI portal
The following pages link to Global optimization for sum of linear ratios problem with coefficients (Q2493767):
Displaying 29 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)
- Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
- A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- Global optimization for sum of linear ratios problem using new pruning technique (Q1023182) (← links)
- Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
- Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← 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)
- A new concave reformulation and its application in solving DC programming globally under uncertain environment (Q2244216) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- Global optimization for sum of generalized fractional functions (Q2479363) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- A new efficient approach to tackle multi objective linear fractional problem with flexible constraints (Q2691377) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)