Pages that link to "Item:Q598606"
From MaRDI portal
The following pages link to Using concave envelopes to globally solve the nonlinear sum of ratios problem (Q598606):
Displayed 43 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Global solutions to fractional programming problem with ratio of nonconvex functions (Q299415) (← links)
- 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)
- A global optimization algorithm for sum of quadratic ratios problem with coefficients (Q440994) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- Minimization of isotonic functions composed of Fractions (Q613584) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
- Global optimization of nonlinear sum of ratios problem (Q702537) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem (Q727378) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Practical global optimization for multiview geometry (Q942843) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- Global optimization for sum of geometric fractional functions (Q983970) (← links)
- Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
- Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289) (← links)
- Global optimization for a class of fractional programming problems (Q1037364) (← links)
- A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202) (← links)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- Optimal spares allocation to an exchangeable-item repair system with tolerable wait (Q1753605) (← links)
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908) (← links)
- Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← 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)
- Global optimization for the sum of generalized polynomial fractional functions (Q2460040) (← links)
- Solving sum of ratios fractional programs via concave minimization (Q2465451) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- Global optimization for sum of linear ratios problem with coefficients (Q2493767) (← links)
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region (Q2511139) (← links)
- A branch and bound algorithm to globally solve the sum of several linear ratios (Q2572656) (← links)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- Minimizing the object space error for pose estimation: towards the most efficient algorithm (Q5743218) (← links)
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming (Q5964247) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)