An efficient algorithm for globally solving generalized linear multiplicative programming
From MaRDI portal
Publication:899000
DOI10.1016/J.CAM.2015.11.009zbMATH Open1342.90148OpenAlexW2185733783MaRDI QIDQ899000FDOQ899000
Publication date: 21 December 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.11.009
Recommendations
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization algorithm for a generalized linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- Global optimization algorithm for solving linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
global optimizationlevel set algorithmgeneralized linear multiplicative programmingnonisolated feasible solution
Cites Work
- Generalized concavity
- Solving Bicriterion Mathematical Programs
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Global optimization of multiplicative programs
- Heuristic methods for linear multiplicative programming
- A finite branch-and-bound algorithm for linear multiplicative programming
- A mean-absolute deviation-skewness portfolio optimization model
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Image space analysis of generalized fractional programs
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Solving long-term financial planning problems via global optimization
- A global optimization approach for solving the convex multiplicative programming problem
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- A new accelerating method for globally solving a class of nonconvex programming problems
- Global minimization of a generalized convex multiplicative function
- Global minimization of a generalized linear multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A new global optimization approach for convex multiplicative programming
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Level set algorithm for solving convex multiplicative programming problems
Cited In (18)
- 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
- Global optimization algorithm for solving linear multiplicative programming problems
- Title not available (Why is that?)
- 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
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Level set algorithm for solving convex multiplicative programming problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
This page was built for publication: An efficient algorithm for globally solving generalized linear multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899000)
