Pages that link to "Item:Q5085229"
From MaRDI portal
The following pages link to Global optimization algorithm for solving linear multiplicative programming problems (Q5085229):
Displaying 15 items.
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- The global solver in the LINDO API (Q3396390) (← links)
- (Q3486369) (← 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)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
