Pages that link to "Item:Q450102"
From MaRDI portal
The following pages link to Global minimization of a generalized linear multiplicative programming (Q450102):
Displaying 18 items.
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← 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 out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← 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)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
