Pages that link to "Item:Q2174910"
From MaRDI portal
The following pages link to Global algorithm for solving linear multiplicative programming problems (Q2174910):
Displaying 30 items.
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- Global optimization of multiplicative programs (Q1404396) (← 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)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- An accelerating algorithm for a class of multiplicative programming (Q2887384) (← links)
- Solving globally the linear multiplicative programming problem via monotonic functions (Q2916532) (← links)
- A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem (Q2924147) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
- (Q3146104) (← links)
- The global solver in the LINDO API (Q3396390) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← 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)
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
