Global optimization of multiplicative programs
From MaRDI portal
Recommendations
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Global Optimization of Convex Multiplicative Programs by Duality Theory
- A global optimization for a class of multiplicative programming problems
- Global minimization of a generalized linear multiplicative programming
- Global algorithm for solving linear multiplicative programming problems
Cited in
(73)- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- MILP approach to pattern generation in logical analysis of data
- Global optimization of linear multiplicative programming using univariate search
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A nonisolated optimal solution of general linear multiplicative programming problems
- Solving multiplicative programs by binary-encoding the multiplication operation
- Global optimization of a rank-two nonconvex program
- A FPTAS for a class of linear multiplicative problems
- Global optimization algorithm for solving linear multiplicative programming problems
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- A new linearization method for generalized linear multiplicative programming
- A deterministic approach to linear programs with several additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- A new accelerating method for globally solving a class of nonconvex programming problems
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Rank-two programs involving linear fractional functions
- Theoretical and computational results about optimality-based domain reductions
- A review of recent advances in global optimization
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- scientific article; zbMATH DE number 1799337 (Why is no real title available?)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- A vector linear programming approach for certain global optimization problems
- Two-level linear relaxation method for generalized linear fractional programming
- Global optimization method for linear multiplicative programming
- A branch and reduce approach for solving a class of low rank d.c. programs
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- Underestimation functions for a rank-two partitioning method
- Global minimization of a generalized linear multiplicative programming
- A convex analysis approach for convex multiplicative programming
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- Linear multiplicative programming
- An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Solving generalized polynomial problem by using new affine relaxed technique
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
- On linear multiplicative programming.
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- Strong valid inequalities for Boolean logical pattern generation
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- A method based on parametric convex programming for solving convex multiplicative programming problem
- Approximating a linear multiplicative objective in watershed management optimization
- Data separation via a finite number of discriminant functions: a global optimization approach
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- An efficient algorithm for computing a class of multiplicative optimization problem
- A global optimization for a class of multiplicative programming problems
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- Global maximization of a generalized concave multiplicative function
- A mini review on UAV mission planning
- Outer approximation algorithms for canonical DC problems
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
- Nonlinear separation of data via mixed 0-1 integer and linear programming
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Global minimization for generalized polynomial fractional program
This page was built for publication: Global optimization of multiplicative programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404396)
