A FPTAS for a class of linear multiplicative problems

Authors:
Daniele Depetrini;Marco Locatelli
Affiliations:
Dipartimento di Informatica, Università di Torino, Torino, Italy 10149;Dipartimento di Informatica, Università di Torino, Torino, Italy 10149
Venue:
Computational Optimization and Applications
Year:
2009

Citing 12
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Approximation algorithms for indefinite quadratic programming

Mathematical Programming: Series A and B
Linear multiplicative programming

Mathematical Programming: Series A and B
Finite algorithm for generalized linear multiplicative programming

Journal of Optimization Theory and Applications
Multiplicative programming problems: analysis and efficient point search heuristic

Journal of Optimization Theory and Applications
Outcome-space cutting-plane algorithm for linear multiplicative programming

Journal of Optimization Theory and Applications
A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming

Computational Optimization and Applications
An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming

Journal of Global Optimization
Heuristic Methods for Linear Multiplicative Programming

Journal of Global Optimization
A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems

Journal of Global Optimization
Global Optimization of Multiplicative Programs

Journal of Global Optimization
Quadratic programming and combinatorial minimum weight product problems

Mathematical Programming: Series A and B

Approximation algorithm for a class of global optimization problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of minimizing the product of two affine functions over a polyhedral set. An approximation algorithm is proposed and it is proved that it is a Fully Polynomial Time Approximation Scheme. We will also present and computationally investigate an exact version of the algorithm.