Pages that link to "Item:Q4602158"

The following pages link to An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem (Q4602158):

Displaying 18 items.

• A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
• A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
• An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← 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)
• A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
• Perturbation of the Moore–Penrose Metric generalized inverse with applications to the best approximate solution problem in <i>L</i>^p(Ω, μ) (Q5031807) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces (Q5086886) (← 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 accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
• An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation (Q6586226) (← links)