Pages that link to "Item:Q2378273"

The following pages link to A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273):

Displaying 12 items.

• A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
• Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• Global Optimization of Linear Multiplicative Programming Using Univariate Search (Q4982140) (← 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)
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)