Finite algorithm for generalized linear multiplicative programming

DOI10.1007/BF02192573zbMath0839.90113OpenAlexW2090208682MaRDI QIDQ1906745

Claudio Sodini, Siegfried Schaible

Publication date: 23 June 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192573

zbMATH Keywords

linear mutliplicative programmingminimizing the sum of a linear function and the product of two linear functionsparametric simplex methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (31)

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 ⋮ Global optimization of a rank-two nonconvex program ⋮ 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 ⋮ Multiplicative programming problems: Analysis and efficient point search heuristic ⋮ Linearization method for a class of multiplicative programming with exponent ⋮ On the minimization of a class of generalized linear functions on a flow polytope ⋮ 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 parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound ⋮ A practicable branch-and-bound algorithm for globally solving linear multiplicative programming ⋮ Global minimization of a generalized linear multiplicative programming ⋮ Global minimization for generalized polynomial fractional program ⋮ A new accelerating method for globally solving a class of nonconvex programming problems ⋮ A new two-level linear relaxed bound method for geometric programming problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions ⋮ 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 ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ Outcome-space cutting-plane algorithm for linear multiplicative programming ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ Level set algorithm for solving convex multiplicative programming problems ⋮ Approximating a linear multiplicative objective in watershed management optimization ⋮ Global optimization method for linear multiplicative programming

Cites Work

• Unnamed Item
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Generalized linear multiplicative and fractional programming
• Massimo della somma tra una funzione lineare ed una funzione lineare fratta
• On Maximizing a Sum of Ratios

This page was built for publication: Finite algorithm for generalized linear multiplicative programming