Pages that link to "Item:Q1721616"
From MaRDI portal
The following pages link to Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616):
Displaying 17 items.
- A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
- A new global optimization approach for convex multiplicative programming (Q972168) (← links)
- A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← 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)
- Global optimization reduction of generalized Malfatti's problem (Q2358905) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- (Q5038031) (← 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)
- Conditional gradient and bisection algorithms for non-convex optimization problem with random perturbation (Q6106813) (← 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)
