The following pages link to (Q4352213):
Displaying 20 items.
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
- A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← 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)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← 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)
- 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)
- 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)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
