A nonisolated optimal solution of general linear multiplicative programming problems

DOI10.1016/j.cor.2008.11.002zbMath1179.90262OpenAlexW2069847787MaRDI QIDQ1010262

Hong-Wei Jiao, Yong-Qiang Chen

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.002

zbMATH Keywords

global optimizationbranch-and-boundnonconvex optimizationnonisolated optimal solutiongeneral linear multiplicative programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An out space accelerating algorithm for generalized affine multiplicative programs problem ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• An outcome-space finite algorithm for solving linear multiplicative programming
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• A global optimization approach for solving the convex multiplicative programming problem
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
• A mean-absolute deviation-skewness portfolio optimization model
• Global minimization of a generalized convex multiplicative function
• Bilinear separation of two sets in \(n\)-space
• Multiplicative programming problems: Analysis and efficient point search heuristic
• Solving long-term financial planning problems via global optimization
• Global optimization of multiplicative programs
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Heuristic methods for linear multiplicative programming
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• A branch-and-reduce approach to global optimization
• Solving a class of multiplicative programs with 0-1 knapsack constraints
• \(NP\)-hardness of linear multiplicative programming and related problems
• Monotonic Optimization: Problems and Solution Approaches
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• Robust Optimization of Large-Scale Systems
• Monotonic Optimization: Branch and Cut Methods
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A finite branch-and-bound algorithm for linear multiplicative programming