Pages that link to "Item:Q864775"
From MaRDI portal
The following pages link to Linearization method for a class of multiplicative programming with exponent (Q864775):
Displaying 17 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)
- A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← 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)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← 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 method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
- A variant of trust-region methods for unconstrained optimization (Q2518723) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
