Pages that link to "Item:Q927239"
From MaRDI portal
The following pages link to Global maximization of a generalized concave multiplicative function (Q927239):
Displaying 14 items.
- On the solution of generalized multiplicative extremum problems (Q635793) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set (Q2358305) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← 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)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)