Pages that link to "Item:Q330338"
From MaRDI portal
The following pages link to Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338):
Displaying 13 items.
- 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)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← 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 effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- Perturbation of the Moore–Penrose Metric generalized inverse with applications to the best approximate solution problem in <i>L</i><sup>p</sup>(Ω, μ) (Q5031807) (← links)
- The Sherman–Morrison–Woodbury formula for the Moore–Penrose metric generalized inverse (Q5145549) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
