Heuristic methods for linear multiplicative programming
From MaRDI portal
Recommendations
- Linear multiplicative programming
- On linear multiplicative programming.
- Multiplicative programming problems: Analysis and efficient point search heuristic
- A finite branch-and-bound algorithm for linear multiplicative programming
- A parametric method for solving linear multiplicative programming problem
Cited in
(43)- A nonisolated optimal solution of general linear multiplicative programming problems
- Linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- On duality for a class of quasiconcave multiplicative programs
- Range division and linearization algorithm for a class of linear ratios optimization problems
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Global optimization method for linear multiplicative programming
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- On linear multiplicative programming.
- Global optimization algorithm for a generalized linear multiplicative programming
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Theoretical and computational results about optimality-based domain reductions
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- Nonlinear 0–1 programming: I. Linearization techniques
- scientific article; zbMATH DE number 3984564 (Why is no real title available?)
- Duality for linear multiplicative programs
- An efficient algorithm for computing a class of multiplicative optimization problem
- Global optimization algorithm for solving linear multiplicative programming problems
- Quadratic factorization heuristics for copositive programming
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- A method based on parametric convex programming for solving convex multiplicative programming problem
- An adaptive optimization algorithm to solve a class of linear multiplicative problems
- Spatial algorithm for mixed integer generalized affine multiplicative problems
- A novel branch and bound algorithm for solving the linear multiplicative programming problems
- Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- Globally minimizing a class of fractional multiplicative problems using the separability of relaxation problem
- Globally minimizing a class of linear multiplicative programming under the flexible branching scheme
- Convex relaxation technique-based output space branch-reduction-bound algorithm for minimizing generalized linear fractional multiplicative programs
- A FPTAS for a class of linear multiplicative problems
- An outcome-space finite algorithm for solving linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A convex analysis approach for convex multiplicative programming
This page was built for publication: Heuristic methods for linear multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567074)
