The following pages link to On Maximizing a Sum of Ratios (Q3832344):
Displaying 30 items.
- 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)
- Generating the efficient set of multiobjective integer linear plus linear fractional programming problems (Q828869) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- A sequential method for a class of pseudoconcave fractional problems (Q940830) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
- Duality of a nonconvex sum of ratios (Q1265048) (← links)
- Image space analysis of generalized fractional programs (Q1315441) (← links)
- Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Integer quadratic fractional programming problems with bounded variables (Q1730454) (← links)
- Finite algorithm for generalized linear multiplicative programming (Q1906745) (← links)
- On Pareto-optimality in the cross-efficiency evaluation (Q2028862) (← links)
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)
- Solving sum of ratios fractional programs via concave minimization (Q2465451) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
- (Q3384769) (← links)
- The optimal level solution method applied to a non linear programming problem with exponential objective function (Q4522310) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
- Global optimization algorithm for the nonlinear sum of ratios problem (Q5959898) (← links)
- A linearization to the multi-objective linear plus linear fractional program (Q6063798) (← links)
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)
- A potential practical algorithm for minimizing the sum of affine fractional functions (Q6106325) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)
