Global minimization of a generalized linear multiplicative programming
From MaRDI portal
Publication:450102
DOI10.1016/J.APM.2011.09.002zbMATH Open1246.90162OpenAlexW2024898754MaRDI QIDQ450102FDOQ450102
Authors: Chunfeng Wang, Peiping Shen, Sanyang Liu 
Publication date: 13 September 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.09.002
Recommendations
- Global optimization of multiplicative programs
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- Global optimization algorithm for a generalized linear multiplicative programming
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Introduction to global optimization
- Linear multiplicative programming
- A global optimization approach for solving the convex multiplicative programming problem
- Finite algorithm for generalized linear multiplicative programming
- Global minimization of a generalized convex multiplicative function
- Generalized linear multiplicative and fractional programming
- An outcome space approach for generalized convex multiplicative programs
Cited In (34)
- 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
- An accelerating algorithm for globally solving nonconvex quadratic programming
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A simplex branch-and-bound method of a class of multi-product programming problems
- Global optimization algorithm for solving linear multiplicative programming problems
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- Title not available (Why is that?)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- Global algorithm for solving linear multiplicative programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Global optimization reduction of generalized Malfatti's problem
- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Finite algorithm for generalized linear multiplicative programming
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- Solving generalized polynomial problem by using new affine relaxed technique
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- Global optimization of multiplicative programs
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- Global minimization of a generalized convex multiplicative function
- Approximating a linear multiplicative objective in watershed management optimization
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Solving globally the linear multiplicative programming problem via monotonic functions
- Inner approximation algorithm for generalized linear multiplicative programming problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
This page was built for publication: Global minimization of a generalized linear multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450102)
