Thumbnail - Request a copy

Approximating the optimal sequence of acquisitions and sales with a capped budget

Gourvès, Laurent (2015), Approximating the optimal sequence of acquisitions and sales with a capped budget, Information Processing Letters, 115, 10, p. 760-764. 10.1016/j.ipl.2015.05.001

Type
Article accepté pour publication ou publié
Date
2015
Journal name
Information Processing Letters
Volume
115
Number
10
Publisher
Elsevier
Pages
760-764
Publication identifier
Metadata
Show full item record
Author(s)
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We introduce and study the approximability of the following problem. There is a set of useful objects that are available for purchase, and another set of useless objects that can be sold. Selling useless objects generates revenue which allows to acquire useful objects. We search for a sequence of decisions (buying or selling objects) which optimizes either the number of purchased objects or their global utility. One of the constraints is that, at any time, only a limited amount of money can be held.
Subjects / Keywords
Approximation; Greedy algorithms; Knapsack problem
JEL
C44 - Operations Research; Statistical Decision Theory