An outcome-space finite algorithm for solving linear multiplicative programming

DOI10.1016/j.amc.2005.11.111zbMath1103.65065OpenAlexW1963838357MaRDI QIDQ849749

Yuelin Gao, Cheng-Xian Xu, Yong-jian Yang

Publication date: 31 October 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.111

zbMATH Keywords

algorithmglobal optimizationconvergencenumerical resultslinear multiplicative programmingconvex quadratic programmingouter approximation methodoutcome-space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05)

Related Items

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ A FPTAS for a class of linear multiplicative problems ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints ⋮ Global optimization of generalized linear fractional programming with nonlinear constraints ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ A new linearization method for generalized linear multiplicative programming ⋮ A branch-and-reduce approach for solving generalized linear multiplicative programming ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ A new accelerating method for globally solving a class of nonconvex programming problems ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ A new global optimization approach for convex multiplicative programming ⋮ Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ HYBRID CODING PSO-ACO CO-EVOLUTIONARY ALGORITHM FOR SOLVING MIXED-INTEGER PROGRAMMING PROBLEMS ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ Approximating a linear multiplicative objective in watershed management optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• 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
• Linear multiplicative programming
• Vector maximization with two objective functions
• A mean-absolute deviation-skewness portfolio optimization model
• Global minimization of a generalized convex multiplicative function
• Image space analysis of generalized fractional programs
• Bilinear separation of two sets in \(n\)-space
• Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
• 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
• Finite algorithm for generalized linear multiplicative programming
• Solving a class of multiplicative programs with 0-1 knapsack constraints
• Generalized linear multiplicative and fractional programming
• \(NP\)-hardness of linear multiplicative programming and related problems
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Robust Optimization of Large-Scale Systems
• Solving Bicriterion Mathematical Programs