Pages that link to "Item:Q2285918"
From MaRDI portal
The following pages link to Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918):
Displaying 19 items.
- Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← 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)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← 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)
