Pages that link to "Item:Q2511121"
From MaRDI portal
The following pages link to Global optimization algorithm for a generalized linear multiplicative programming (Q2511121):
Displaying 16 items.
- 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)
- 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)
- 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 solving linear multiplicative programming problems (Q5085229) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← 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)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
