A new linearization method for generalized linear multiplicative programming
From MaRDI portal
Publication:622153
DOI10.1016/J.COR.2010.10.016zbMATH Open1208.90162OpenAlexW2024988725MaRDI QIDQ622153FDOQ622153
Authors: Chunfeng Wang, Sanyang Liu 
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.016
Recommendations
- Global optimization method for linear multiplicative programming
- Global optimization for generalized linear multiplicative programming using convex relaxation
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- Global minimization of a generalized linear multiplicative programming
Cites Work
- DC programming: overview.
- Title not available (Why is that?)
- Robust Optimization of Large-Scale Systems
- Generalized concavity
- 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
- A unified monotonic approach to generalized linear fractional programming
- A new efficient algorithm based on DC programming and DCA for clustering
- Image space analysis of generalized fractional programs
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Title not available (Why is that?)
- A global optimization approach for solving the convex multiplicative programming problem
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving 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
- On covering method for d.c. optimization.
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Finding GM-estimators with global optimization techniques
- Some representation theorems for functions and sets and their application to nonlinear programming
Cited In (30)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- New class of multiplicative algorithms for solving of entropy-linear programs
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Linearization method for a class of multiplicative programming with exponent
- Two-level linear relaxation method for generalized linear fractional programming
- Global optimization method for linear multiplicative programming
- Finite algorithm for generalized linear multiplicative programming
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- Solving generalized polynomial problem by using new affine relaxed technique
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- Linear decomposition approach for a class of nonconvex programming problems
- An improved general Phase-I method in linear programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A method based on parametric convex programming for solving convex multiplicative programming problem
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Title not available (Why is that?)
- Inner approximation algorithm for generalized linear multiplicative programming problems
- An efficient polynomial time algorithm for a class of generalized linear multiplicative programs with positive exponents
- On linear programming relaxations for solving polynomial programming problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Inexact linear programming with generalized technological matrix sets
- 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
- Title not available (Why is that?)
- A new method for solving a class of multiplicative programming
This page was built for publication: A new linearization method for generalized linear multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622153)
