Pages that link to "Item:Q702537"
From MaRDI portal
The following pages link to Global optimization of nonlinear sum of ratios problem (Q702537):
Displaying 33 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)
- 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)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- Generating sum-of-ratios test problems in global optimization (Q597195) (← links)
- Using concave envelopes to globally solve the nonlinear sum of ratios problem (Q598606) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
- Global optimization for sum of geometric fractional functions (Q983970) (← 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)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← links)
- Global optimization for the sum of certain nonlinear functions (Q1724059) (← 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)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← 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)
- A note on the paper ``Global optimization of nonlinear sum of ratios'' (Q2372063) (← 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 linear ratios problem with coefficients (Q2493767) (← links)
- Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
- (Q3420679) (← links)
- (Q3642290) (← links)
- (Q4901855) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
- Global optimization algorithm for the nonlinear sum of ratios problem (Q5959898) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)