An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
From MaRDI portal
Publication:1567067
DOI10.1023/A:1008316429329zbMath0997.90078OpenAlexW2280657913MaRDI QIDQ1567067
Publication date: 5 June 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008316429329
branch and bound algorithmquasiconcave minimizationconvex multiplicative programmingoutcome space problem
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ A FPTAS for a class of linear multiplicative problems ⋮ An outcome-space finite algorithm for solving linear multiplicative programming ⋮ An integrated approach to redundancy allocation and test planning for reliability growth ⋮ Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ A convex analysis approach for convex multiplicative programming ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ An outcome space approach for generalized convex multiplicative programs ⋮ A new global optimization approach for convex multiplicative programming ⋮ A new two-level linear relaxed bound method for geometric programming problems ⋮ Fractional programming with convex quadratic forms and functions ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Global optimization of nonlinear sums of ratios ⋮ Global optimization algorithm for the nonlinear sum of ratios problem ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ Global Optimization of Linear Multiplicative Programming Using Univariate Search ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection ⋮ Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints ⋮ Global optimization method for linear multiplicative programming
This page was built for publication: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
