A global optimization approach for solving generalized nonlinear multiplicative programming problem
From MaRDI portal
(Redirected from Publication:1724645)
Recommendations
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization of multiplicative programs
- Global optimization for generalized linear multiplicative programming using convex relaxation
- A global optimization for a class of multiplicative programming problems
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
Cites work
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- A finite branch-and-bound algorithm for linear multiplicative programming
- A global optimization approach for solving the convex multiplicative programming problem
- A new linearization method for generalized linear multiplicative programming
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A quadratic programming approach to the multi-product newsvendor problem with side constraints
- A stochastic geometric programming problem with multiplicative recourse
- Allocation of resources in project management
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Global minimization of a generalized convex multiplicative function
- Global optimization for special reverse convex programming
- Global optimization of multiplicative programs
- Heuristic methods for linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- Solving long-term financial planning problems via global optimization
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(17)- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A criterion space algorithm for solving linear multiplicative programming problems
- A nonisolated optimal solution of general linear multiplicative programming problems
- Global optimization algorithm for solving linear multiplicative programming problems
- A deterministic approach to linear programs with several additional multiplicative constraints
- scientific article; zbMATH DE number 1799337 (Why is no real title available?)
- Global algorithm for solving linear multiplicative programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- Global optimization of multiplicative programs
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Global maximization of a generalized concave multiplicative function
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Global optimization for generalized linear multiplicative programming using convex relaxation
This page was built for publication: A global optimization approach for solving generalized nonlinear multiplicative programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724645)
