A Graphical Approach to Solve an Investment Optimization Problem - Mines Saint-Étienne Access content directly
Reports Year : 2012

A Graphical Approach to Solve an Investment Optimization Problem

Abstract

We consider a Project Investment problem, where a set of projects and an overall budget are given. For each project, a profit function is known which describes the profit obtained if a specific amount is invested in this project. The objective is to determine the amount invested in each project such that the overall budget is not exceeded and the total profit is maximized. For this problem, we suggest an effective graphical algorithm which improves the pseudo-polynomial time complexity of dynamic programming algorithms. Based on this graphical algorithm, we also derive a fully polynomial time approximation scheme. In addition, we also consider the related problem of finding lot-sizes and sequencing several products on a single imperfect machine.
No file

Dates and versions

emse-00904098 , version 1 (13-11-2013)

Identifiers

  • HAL Id : emse-00904098 , version 1

Cite

Evgeny R. Gafarov, Alexander Lazarev, Alexandre Dolgui, Frank Werner. A Graphical Approach to Solve an Investment Optimization Problem. 2012. ⟨emse-00904098⟩
113 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More