Heuristic methods for linear multiplicative programming
From MaRDI portal
Publication:1567074
DOI10.1023/A:1008308913266zbMath0966.90051OpenAlexW1569574031MaRDI QIDQ1567074
Publication date: 20 August 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008308913266
Sensitivity, stability, parametric optimization (90C31) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ Theoretical and computational results about optimality-based domain reductions ⋮ A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ A method of acceleration for a class of multiplicative programming problems with exponent ⋮ A FPTAS for a class of linear multiplicative problems ⋮ An outcome-space finite algorithm for solving linear multiplicative programming ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ Linearization method for a class of multiplicative programming with exponent ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ A new linearization method for generalized linear multiplicative programming ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ On duality for a class of quasiconcave multiplicative programs ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ A convex analysis approach for convex multiplicative programming ⋮ Duality for linear multiplicative programs ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ An out space accelerating algorithm for generalized affine multiplicative programs problem ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ Global optimization method for linear multiplicative programming
This page was built for publication: Heuristic methods for linear multiplicative programming
