Pages that link to "Item:Q899000"
From MaRDI portal
The following pages link to An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000):
Displaying 12 items.
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← 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)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
