A new linearization method for generalized linear multiplicative programming

DOI10.1016/J.COR.2010.10.016MaRDI QIDQ622153zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

branch and bound

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

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

• scientific article; zbMATH DE number 3769296 (Why is no real title available?)
• scientific article; zbMATH DE number 3356443 (Why is no real title available?)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A finite branch-and-bound algorithm for linear multiplicative programming
• A global optimization approach for solving the convex multiplicative programming problem
• A mean-absolute deviation-skewness portfolio optimization model
• A method of acceleration for a class of multiplicative programming problems with exponent
• A new accelerating method for globally solving a class of nonconvex programming problems
• A new efficient algorithm based on DC programming and DCA for clustering
• A unified monotonic approach to generalized linear fractional programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• DC programming: overview.
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Finding GM-estimators with global optimization techniques
• Generalized concavity
• Global optimization of multiplicative programs
• Heuristic methods for linear multiplicative programming
• Image space analysis of generalized fractional programs
• Linearization method for a class of multiplicative programming with exponent
• On covering method for d.c. optimization.
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Robust Optimization of Large-Scale Systems
• Some representation theorems for functions and sets and their application to nonlinear programming

Cited in

(30)

• Inner approximation algorithm for generalized linear multiplicative programming problems
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Global optimization algorithm for a generalized linear multiplicative programming
• An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
• On linear programming relaxations for solving polynomial programming problems
• Finite algorithm for generalized linear multiplicative programming
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A global optimization approach for solving generalized nonlinear multiplicative programming problem
• A new method for solving a class of multiplicative programming
• An efficient polynomial time algorithm for a class of generalized linear multiplicative programs with positive exponents
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• Linear decomposition approach for 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
• Inexact linear programming with generalized technological matrix sets
• scientific article; zbMATH DE number 5000794 (Why is no real title available?)
• New class of multiplicative algorithms for solving of entropy-linear programs
• A branch-and-reduce approach for solving generalized linear multiplicative programming
• Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• An efficient algorithm for globally solving generalized linear multiplicative programming
• Linearization method for a class of multiplicative programming with exponent
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
• Global optimization method for linear multiplicative programming
• 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
• Solving generalized polynomial problem by using new affine relaxed technique
• scientific article; zbMATH DE number 2010093 (Why is no real title available?)
• A method based on parametric convex programming for solving convex multiplicative programming problem
• Two-level linear relaxation method for generalized linear fractional programming
• An improved general Phase-I method in linear 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)