Pages that link to "Item:Q6060545"
From MaRDI portal
The following pages link to Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545):
Displaying 4 items.
- 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 self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- Optimality conditions for differentiable linearly constrained pseudoconvex programs (Q6655438) (← links)
